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
raman_111: 2020-03-29 07:00:05

if you getting wrong or tle i sugges you to first try KNPSAK(spoj problem dp)
then come here again......try to analyse how many budget you will spent for max enjoy

shikhar_may7: 2020-03-26 12:40:14

You can try WACHOVIA too

Last edit: 2020-03-26 12:41:13
vritta: 2020-03-22 11:48:07

For those who are facing difficulty use this link- "" and you can watch video of 'tushar roy' on youtube for knapsack problem.

Last edit: 2020-03-22 11:48:25
walt1702: 2020-02-03 11:20:04

Big thank you to @Linus

cpp219: 2020-01-17 15:50:44

use 2D DP with bottom-up fashion

mohammadsaad: 2020-01-16 16:25:00

The thing is printing of sum of entrance fees!!! WHICH IS EASY

makkycp: 2020-01-04 05:18:53

Knapsack implementation!

Last edit: 2020-01-04 08:30:26
cepheuskg: 2019-07-06 22:07:42

First Time AC in one go!!!!!!

anik_: 2019-05-06 22:27:14

0/1 Knapsack with binary search.

spojwithsaurav: 2019-04-13 15:49:29

similar to 0/1 Knapsack
AC in 1 go ))

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