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
trantheba0:
20210215 07:06:56
Wait a minute, I'm using memorization with 3 state but I can't figure out my code's time complexity and how to solve it using normal dp base on this code: [don't post any code here] Last edit: 20210216 00:10:35 

distructo:
20201220 11:00:07
Ignore N...what is wrong with the problem setter :( 

imsrvstv:
20201127 13:41:02
just don't consider 'n' at all while solving. It's super easy then! 

tanuj_yadav_07:
20201117 14:16:21
worst problem on spoj i have ever seen


pink_bot1:
20201117 13:09:39
Poor problem statement 

ch_sanchit:
20200903 18:59:09
I wonder how can I solve it considering 'at most n packets'.. Otherwise I hav solved it and it got accepted too. Someone plz help 

akarsh777:
20200829 06:59:22


arpit8969:
20200515 12:23:47
it's similar to coin change problem 

aryan__0406:
20200505 15:06:47
This is a misleading question.Don't consider n while solving it.


Sumit :
20200428 17:49:02
Make sure you understand rod cutting problem before this. This should be very simple variant if you have understood the concept correctly.

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 