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
fzulfa:
20170227 08:52:54
Last edit: 20170307 03:45:40 

fzulfa:
20170227 08:51:42
Last edit: 20170307 03:45:04 

crenchkeren:
20170227 05:35:05
what is going on? "N" is very useless. 

flyingduchman_:
20170224 10:54:34
Just do the "rod cutting algorithm" for minimum instead of maximum profit. "n" is useless. try:http://ideone.com/3OM6IR.


blackjag:
20170223 06:39:24
OP i i think you should reconsider your testcase Last edit: 20170307 09:27:16 

naufalpf:
20170222 10:11:00
Last edit: 20170227 18:04:47 

abhishek18620:
20170219 01:12:12
Its a wrongly frammed question.... just ignore n and treat it like rod cutting.,, ;) 

riu_20:
20170218 06:42:16
My 100th! ;) 

rishab_arora89:
20170119 09:02:25
Nice Dp problem for beginners !!! 

madhavgaba:
20170104 10:18:59
Although test cases are weak, consideration of n won't make it complex. Just traverse through the last column of dp array from bottom and count the number of packets being used and break at the point where number of packets <= n :) 
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 