Problem in short: We are given N pairs and from each pair we have to choose one element such that the difference between chosen sum and not chosen sum is minimized. N <= 150, value of elements <= 300.
Part of course:
[EQGIFTS] Equal Gifts
Problem in short: We are given N pairs and from each pair we have to choose one element such that the difference between chosen sum and not chosen sum is minimized. N <= 150, value of elements <= 300.