Advertisement blocking software were detected ;( Please add this webpage to whitelist.

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
gohanssj9: 2015-10-04 15:04:22

DP !! :) AC in 3rd attempt...Nice one!

Sriharshaa Sammeta: 2015-09-30 16:49:15

0-1 Knapsack understanding + using DP in array table + last row verification to find min cost !

yash : 2015-09-26 20:13:24

I'm writing in cpp its passing all the test cases in the comment and in the problem but getting a WA

ahmed abdel magied hussein: 2015-09-26 06:19:42

easy problem about the classical dynamic programming (0/1 knapsack problem)

Last edit: 2015-09-26 07:19:27
maxy: 2015-09-19 09:19:51

Got right on Idle but not here...
How can I deal with the ending 0 0 ?
Can anyone guide about giving inputs?

Last edit: 2015-09-19 09:21:02
tarunkc_code0: 2015-08-20 14:37:46

Last edit: 2015-08-30 17:02:03
Babu: 2015-08-20 09:39:01

traverse down ur memo to find the least money :)

MAYANK NARULA: 2015-08-19 18:28:00

Pretty Simple :)

SUBHAJIT GORAI: 2015-08-19 18:16:17

optimal solution .....
means minimum fees and maximum fun

rk: 2015-08-17 08:23:35

nice one :) test case to ensure ur ans is correct
7 2
5 1
6 1
0 0
ans is 5 1

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