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 at most ‘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.

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

hide comments
2016-03-22 09:07:40 Shashank Tiwari
Let me simplify what the problem says ...

A boy has 'N' friends and for them he has to buy 'K' kgs of apples. He goes to shop and finds that there are unlimited number of boxes of apples for each of 1kg , 2 kg , 3kg , ... K kgs .

These 1 ,2 ,.. ,K kgs boxes have prices attached to them. Prices are integers between -1 to 1000. '-1' price means he cannot buy that very kg box right now as it is currently not available.

The problem is to choose boxes in such way that total weight = K and total price is as minimum as possible.He can choose multiple boxes of any weight. Also , Though we take 'N' in input , no where we need this 'N'.

INPUT

N K

prices of those 1,2,.. k kg boxes repectively

(pls remember these boxes , if available are present in infinite number ; -1 price denote that very kg boxes are not available )

Output

Minimum price ; if no solution exist just print -1

Last edit: 2016-03-22 09:08:48
2016-03-22 08:05:49
I get a lot of WA, please more testcases.
2016-03-02 10:07:13 minhthai
price can be 0 ...
2016-02-25 14:30:05 (Tjandra Satria Gunawan)(曾毅昆)
ignore the n, and you'll get AC..
2016-02-24 20:08:22
-1 <= price <= 1000 not 0 < price <= 1000
the price can be zero

Last edit: 2016-02-24 20:08:44
2016-02-23 07:52:57
easy one- take care that one packet can be choosen more than 1 time
2016-01-24 22:17:31
my 60th,,,,,easy one
2016-01-09 07:24:18 Amitayush Thakur
Input test file has spacing problem. My Java solution with BufferedReader didn't get accepted but when I changed it to scanner it got AC. Also the constraint on 'n' is not used. The language of the question is ambiguous too.
2016-01-06 19:51:12 kejriwal
i think your testcases don't include the case where num of bags are > n !! cool problem though :) !!
2015-12-31 12:30:02
no use of varible "n"..but you can get AC even if you take n into account
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.