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
arpit8969: 2020-05-15 12:23:47

it's similar to coin change problem

aryan__0406: 2020-05-05 15:06:47

This is a misleading question.Don't consider n while solving it.
And most importantly don't forget to downvote for this question otherwise a lot of precious time of yours will be wasted on solving these type of questions.

Sumit : 2020-04-28 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.

The test cases doesn't honor n, but even w/ considering n it should be very simple 2D variant of the same problem.

jog_123: 2020-04-15 05:45:30

ignore n!!

ajaygupta007: 2020-04-01 21:10:38

it is similar as knapsack problem ?

Last edit: 2020-04-01 21:11:08
kauai68: 2020-03-18 20:39:17

prices can be 0!

cpp219: 2020-01-13 16:44:22

make no notice about n still give AC??? how???

viveki1s10: 2020-01-05 07:08:10

The solution is accepted when the number of packets is not restricted to n. Though in the question it is clearly written that number of packets cannot be more than n.

srtpatil_2000: 2020-01-01 14:13:16

ATMOST n!!!!!
just do unbound knapsack to get minimum value
just care for -1

payalmangla17: 2019-12-27 16:00:17

Test cases are very weak.


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