If you want to find a subset of the numbers such that their sum is the largest possible value no greater than the given number X, that's called the backpack problem. I imagine your problem is mathematically equivalent.
Joined: Aug 13, 2004
is there a java implementation of this algorithm? thanks