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
suraj_:
20170518 17:35:07
it is similar to unbounded knapsack


akshayvenkat:
20170510 02:12:03
Its a simple 1D problem , @big_o_logn !


big_o_logn:
20170508 00:46:54
Can anyone tell me what is wrong with my algorithm?


mishmetall:
20170506 23:47:29
Terrible problem. As other says, solution for AC does not consider N and is classic cut rope problem, however it should, as for problem


micro14:
20170506 15:21:44
AC in 1 go!!!! 

sun_tail:
20170506 14:21:39
I have to say it hard for me. Thank the body who teach me dp with your code 

scube6897:
20170504 10:14:31
Ac in first go.The correct solution is accepted guys. Do try it .Very good problem!


srbcheema1:
20170405 23:15:18
please don't waste your time in this wrong question


frenicohansen:
20170327 17:26:38
don't consider the n 

shubham_001:
20170317 15:06:43
test cases aren't good enough ,not checking whether n is lesser 
Added by:  Kashyap Krishnakumar 
Date:  20120113 
Time limit:  0.148s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 
Resource:  Own problem 