0-1背包问题需对容量为c 的背包进行装载。从n 个物品中选取装入背包的物品，每件物品i 的重量为wi ，价值为pi 。对于可行的背包装载，背包中物品的总重量不

The 0-1 backpack problem requires loading a backpack of size c. Select the item loaded into the backpack from n items, each item i has a weight of wi and a value of pi. For a viable backpack load, the total weight of the items in the backpack cannot exceed the capacity of the backpack. The best load means that the loaded item has the highest value.