can anyone help me how to do this program?

Question

IT Guru is the CEO of a company X, he went to a show called Vista Tank, where he wants to cut a deal with the vista members for K's money. There are N vista mem bers and the ith member wants to make a deal of D[] money with him, where Oci <=N-1 and D is the array of distinct integers. He is free to accept bids from possib ly zero to N vista members.

Now, IT GURU wants to make a deal with as many vista members as he can. So co uld you help him to make a deal with the maximum number of vista members.

Constraints: 150

1<=N<= 100

1<=K<=1000

Answer 1

хз