2008 Canadian Computing Competition, Day 2
Day 2, Problem 2: Candy
You and a friend have a big bag of candy. You want to keep slim and trim, and so you would like to equalize the candy which you are sharing with your friend in terms of calorie count. That is, your task is to divide the candies into two groups such that the number of calories in each group is as close together as possible.
The first line of input contains the number of different kinds of candy you have in your bag of candy N (1 ≤ N ≤ 100). On the following N lines, there are pairs of numbers describing each type of candy. The candy description is of the form ki ci where ki is the number of that particular type of candy contained in the bag and ci is the calorie count for each piece of that type of candy. You may assume that 1 ≤ ki ≤ 500 and 1 ≤ ci ≤ 200.
Your output is one integer which is the minimum difference of calories between friends
4 3 5 3 3 1 2 3 100
Your friend takes two of the 100-calorie candies, for a total of 200 calories. You keep the remaining candies, which have 126 calories.
You may assume that 50% of the test cases will have at 1 ≤ N, ki, ci ≤ 100. All test cases will have 1 ≤ N ≤ 100, 1 ≤ ki ≤ 500 and 1 ≤ ci ≤ 200. You solution must use at most 512MB of memory and run in at most 6 seconds.
Point Value: 20
Time Limit: 6.00s
Memory Limit: 512M
Added: Dec 07, 2008
C++03, PAS, C, HASK, ASM, RUBY, PYTH2, JAVA, PHP, SCM, CAML, PERL, C#, C++11, PYTH3