ABA12C  Buying Apples!
Harish went to a supermarket to buy exactly ‘k’ kilograms apples for his ‘n’ friends. The supermarket was really weird. The pricing of items was very different. He went to the Apples section and enquired about the prices. The salesman gave him a card in which he found that the prices of apples were not per kg. The apples were packed into covers, each containing ‘x’ kg of apples, x > 0 and ‘x’ is an integer. An ‘x’ kg packet would be valued at ‘y’ rupees. So, the placard contained a table with an entry ‘y’ denoting the price of an ‘x’ kg packet. If ‘y’ is 1 it means that the corresponding packet is not available. Now as apples are available only in packets, he decides to buy atmost ‘n’ packets for his ‘n’ friends i.e he will not buy more than n packets of apples.
Harish likes his friends a lot and so he does not want to disappoint his friends. So now, he will tell you how many friends he has and you have to tell him the minimum amount of money he has to spend for his friends.
Input
The first line of input will contain the number of test cases, C.
Each test case will contain two lines.
The first line containing N and K, the number of friends he has and the amount of Apples in kilograms which he should buy.
The second line contains K space separated integers in which the ith integer specifies the price of a ‘i’kg apple packet. A value of 1 denotes that the corresponding packet is unavailable.
 0 < N <= 100
 0 < K <= 100
 0 < price <= 1000
Output
The output for each test case should be a single line containing the minimum amount of money he has to spend for his friends. Print 1 if it is not possible for him to satisfy his friends.
Sample I/O
Input: 2 3 5 1 1 4 5 1 5 5 1 2 3 4 5 Output: 1 5
Explanation of test cases:
1) As there are only 3 and 4kg packets in the shop, he will not be able to satisfy his friends as he would not be able to buy exactly 5kg of apples.
2) He can buy five 1kg packet as he has to buy 5 kg. So the min money he should spend is 5.
hide comments
s1mran_s1dhu:
20180513 15:10:54
No DP , just Partitions ;)


anshul16227:
20180510 23:45:33
No use of 'n' ie. Ignore the bound on the no. of packets that can be bought. 

pramithas:
20180501 13:23:23
In the second test case,can he buy one 5 kg packet,right?


codekode:
20180415 18:38:16
Worst explanation of test case ever! He won't be able to buy 5 kgs?? Do you mean he has to buy a packet of 5kg and distribute 1 kg to each of 5??? Or do you mean he can't buy 5 identical packs for his friends?? Most misleading explanation ever 

arorabharat:
20180407 23:29:11
weird dp solution got rejected but the corresponding recursive solution got passed


snor_lax13:
20171228 23:58:58
worst DP Problem ever!


rssteja:
20171221 15:48:44
backtrack solution is also being accepted here due to weak constraints on n and k 

abhinavmanthri:
20171219 07:02:39
how to take input in java 

love1024:
20171212 18:12:33
knapsack. consider n for good question. 

avi7997:
20171113 19:34:51
can anyone give me tough test case ?

Added by:  Kashyap Krishnakumar 
Date:  20120113 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 
Resource:  Own problem 