PARTY - Party Schedule

You just received another bill which you cannot pay because you lack the money.
Unfortunately, this is not the first time to happen, and now you decide to investigate the cause of your constant monetary shortness. The reason is quite obvious: the lion's share of your money routinely disappears at the entrance of party localities.

You make up your mind to solve the problem where it arises, namely at the parties themselves. You introduce a limit for your party budget and try to have the most possible fun with regard to this limit.

You inquire beforehand about the entrance fee to each party and estimate how much fun you might have there. The list is readily compiled, but how do you actually pick the parties that give you the most fun and do not exceed your budget?

Write a program which finds this optimal set of parties that offer the most fun. Keep in mind that your budget need not necessarily be reached exactly. Achieve the highest possible fun level, and do not spend more money than is absolutely necessary.


The first line of the input specifies your party budget and the number n of parties.

The following n lines contain two numbers each. The first number indicates the entrance fee of each party. Parties cost between 5 and 25 francs. The second number indicates the amount of fun of each party, given as an integer number ranging from 0 to 10.

The budget will not exceed 500 and there will be at most 100 parties. All numbers are separated by a single space.

There are many test cases. Input ends with 0 0.


For each test case your program must output the sum of the entrance fees and the sum of all fun values of an optimal solution. Both numbers must be separated by a single space.


Sample input:
50 10
12 3
15 8
16 9
16 6
10 2
21 9
18 4
12 4
17 8
18 9 

50 10
13 8
19 10
16 8
12 9
10 2
12 8
13 5
15 5
11 7
16 2

0 0

Sample output:
49 26
48 32

hide comments
vladimira: 2017-02-24 05:46:30

Good example of 0-1 knapsack problem. Read wiki if you arent known with this problem.

vanvinhbk94: 2017-02-17 14:39:18

AC in one go!! use 0/1 Knapsack ^ ^

ankit1cool: 2017-02-09 10:41:06

for beginner ,try to do with recursion will be a great learning experience

gautam: 2017-01-30 11:24:24

good one ..!!

tni_mdixit: 2017-01-23 21:51:43

no need for any backtracking or last row check...order of the loops will do!

tni_mdixit: 2017-01-22 21:50:33

Last edit: 2017-01-23 21:51:59
govindgupta: 2017-01-11 12:12:58

easy one!!! 0-1 knapsack

Last edit: 2017-01-11 12:13:17
epsilonalpha: 2016-12-20 19:01:33

Learnt about 0-1 Knapsack. First I tried backtracking but got a wrong answer, not sure why. Then as usual, the comments were very helpful. :)
A very good problem for those new to DP.
My 60th. :D Cheers.

Last edit: 2016-12-20 19:02:13
akashranjan28: 2016-12-13 12:41:20

AC bottom up approach...
my 50th on spoj !!! many to go...

rohit1507: 2016-11-29 11:46:32

0/1 Knapsack. But do check for minimum money to be used.
i.e. For same amount of fun, choose the one that requires the least total fees.

Added by:Patryk Pomykalski
Time limit:3s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Resource:Swiss Olympiad in Informatics 2004