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
cptn_jack_sprw: 2018-02-07 20:48:10

accepted in one go. simple 0-1 knapsack problem

sinersnvrsleep: 2017-12-22 18:35:10

the condition to minimize the fees is written indirectly , " Achieve the highest possible fun level, and do not spend more money than is absolutely necessary."

madhur4127: 2017-12-02 08:43:09

stop reading comments!

kmkhan_014: 2017-11-28 13:40:59

great question on memoiz

justforpractic: 2017-11-24 18:17:59

note that this problem is a knapsack problem where u can chose each element or at most 1 time .

naks: 2017-09-28 07:41:02

Simple Knapsack!!!!
Ac in 1 go

hitman007: 2017-09-27 19:54:14

Was hunting for root cause of getting wrong answer. Comments really helped me ! Although it is not mentioned in problem that for same value, cost should be minimised, even if it doesn't cross budget. But this condition is required, otherwise expect wrong answer !!

vengatesh15: 2017-09-13 08:32:44

easy one..

sohie: 2017-08-19 11:46:34

When there is many ways to get the max fun, you should choose the one with the min fees.

jayu_jd: 2017-07-08 05:54:14

Very nice Problem for Beginners!
DP 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