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.


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


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

3 5
-1 -1 4 5 -1
5 5
1 2 3 4 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
khaja_mohammad: 2019-07-17 18:13:05

I am getting wrong answer for this problem and I dont know where iam wrong.Please help me out. you can find my solution here in discuss forum.

scolar_fuad: 2019-07-08 18:02:08

I solved it using 3D state

easy variation of 0-1 knapsake Happy coding

abhi_1829: 2019-06-18 12:04:25

Do consider "n" but read carefully regarding how to consider "n". If u are confused about whether same packets can be picked again, think practically ! :)

vcode11: 2019-06-02 11:46:19

Please don't consider N the test cases are wrong. You will get WA if you consider N.

saurav_paul: 2019-05-29 09:07:01

Accepted in one go.
Very nice variation of 01-knapsack.
It is a simply unbounded knapsack.

prabhudeen: 2019-05-14 18:43:52

ac in one go !!!

dkkv0000: 2019-05-08 09:27:00

unbound knapsack

akibk001: 2019-03-26 17:21:22

you can try this test case
4 8
2 5 3 6 -1 -1 10 20

4 8
-1 -1 4 5 6 8 4 10

4 8
2 5 3 6 -1 -1 0 0

answer should be

btcgeek: 2019-03-21 04:29:46

Too damn lucky!!

rishabh_jiit: 2019-03-07 12:35:36

Last edit: 2019-03-07 12:35:47

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