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.
Input
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.
Output
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.
Example
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
burger_king:
20160205 20:24:53
good prob


sharif ullah:
20160128 12:06:13
for finding minimum entrance fee just iterate to badget N. in which dp[m][n]==dp[m][i] 

flyingzen96:
20160126 15:59:47
Is there a top down approach to do this ? How to do you return both expenditure and amount of fun? 

try2catch:
20160116 06:20:53
Just take care of minimum fees.


chuntheqhai:
20160111 05:04:22
To answer this question:


SHIVEK SACKLECHA:
20160104 21:53:25
Simple 0/1 knapsack implementation,no trick! 

Junaid:
20151224 16:51:01
Awesome problem.....though finding the min cost costed me 1WA but it was worth it learned a lot about DP from this problem.....and anando_du thanks dude for your test case...that helped me to debug my code...DP rocks...:) 

sarvesh_19:
20151219 22:47:13
take 2d array size as given ...cost me 1 WA :( Easy DP :)


raghav12345:
20151114 08:10:57
good one...


mathnoob94:
20151104 01:03:51
http://ideone.com/zRV8lo

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