0/1 Knapsack — Type 1 : (https://atcoder.jp/contests/dp/tasks/dp_d)
Solution :
0/1 Knapsack — Type 2 : (https://atcoder.jp/contests/dp/tasks/dp_e)
Solution:
0/1 Knapsack — Type 3 : (https://codeforces.me/gym/101064/problem/L)
How to solve the 3rd one where constraints on both Max capacity(W) of knapsack and (val[i]) is large enough that traditional methods won't work ?
I don't think DP will work here, so what is the other approach we can use?