Help Needed in a question

Revision en1, by Noluck_167, 2023-12-23 12:30:38

Can someone please help me out with the solution of this problem "Natsya decided to visit a local store, which has n items. The i-th item has price a[i]

She has to buy k items out of the n items such that total price of all the items bought is minimum.

In how ways she can buy k items such that the overall price is minimum?"

1<=k<=n<=50 a[i]<=n

I have tried to solve it but it is failing in some hidden cases Code.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English Noluck_167 2023-12-23 12:30:38 487 Initial revision (published)