0-1背包问题：若有物品n个，每个物品的价值Value，用vi表示，每个物品的重量weight用wi表示，其中vi和wi均为非负数。设背包的总容量为W，且W为非负数。本程序可选择装入背包的物品，并使装入背包的物品总价值最大。-Value, with vi, said the weight of each item s weight by wi, where vi and wi are non-negative. The total capacity of the backpack set W, and W is non-negative. This program can choose the items into the backpack, and the total value of goods loaded backpack maximum.