please tell me how do you?
I found one algo but it uses memory equal to W_i limitation. if maximum of W_i is 100000 it uses 100000 too. Maybe it use 2 times more.

Edited by author 05.04.2011 22:59

Hey, did you solve it with DP ? Please let me know how did you solve it ?

Thanks

Hello,
Read about the knapsack problem (http://en.wikipedia.org/wiki/Knapsack_problem#Dynamic_programming_solution) which can be solved with DP and try to figure out how it can be applied here. Good luck!