0—1背包问题描述如下：

给定m种物品和一背包。物品i的重量是w[i]，其价值为v[i]，背包的容量是c，问应如何选择装入背包中的物品，使得装入背包中物品的总价值最大。(每种物品只能选择放入0/1次背包）-0-1 knapsack problem described as follows: given m types of items and a backpack. Item i of the weight of w [i], a value of v [i], the capacity of backpack is c, asking how to choose the items into the backpack, making the backpack into the largest total value of goods. (Each item can only choose to put 0/1 knapsack)