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
vi1: 2017-07-07 17:58:49

Nice problem. Does not require knowlege of any tricky specific algorithms. But it was real AHA moment to figure out how to solve it :)

shresthsoni: 2017-07-05 12:24:57

Last edit: 2017-07-05 13:16:11
coolio_1: 2017-06-25 14:14:18

Classic dp!! AC 0.00!!

ramesh_961: 2017-06-22 15:18:05

Wow AC in 0.00 ! Understood clearly DP Approach for this after watching this: !! And slight modification for weight is "Add weights of less "w".mat be by
" while(k[n][w]==k[n][w-1]"

nermatibhanu: 2017-06-14 08:15:34

not using endl caused me 2 WA!! simply 0-1 knapsack and backtrack

meenaranga: 2017-06-11 03:48:35

be careful in choosing the party with lower fee when the value of two combinations is same.

Rajat Gautam: 2017-05-21 02:34:49

For those getting WA in top down ,check your cache(memo) for n it's 101 and for budget it's 501;

da_201501181: 2017-05-18 12:43:04

Simple 0/1 KnapSack..!! AC in one GO..!

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 ^ ^

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