Does any body have judge for this problem? There are N type of items, for type i three integers is given w_i(weight of the item), v_i(value of the item), c_i(the number item that we have). The capacity of knapsack is W. we want to choose some item so that we have the maximum value. What is that value?

OK. Does anybody know the solution of the problem?

yes, there is a problem on this mentioned in algorithms live lecture on knapsack on open kattis and stefdasca in his channel has shown the approach to do this in n*w*log(min(n,w)) , i guess! But i have heard this can be done even in O(N*W) using offsets and min-queue but i have never done and am also looking for N*W solution actually.

Pashka is also going to talk about variants of knapsack in his next lecture, so u can get an idea there maybe..

See this video