Introduction - If you have any usage issues, please Google them yourself
The 0-1 knapsack problem: N items and a capacity of V backpack. Take the first I items is c[i], the value is w[i]. For which goods loaded backpack can make the value of the sum of the maximum.