背包算法 问题描述 给定一组物品，每种物品都有自己的重量和价格，在限定的总重量内，我们如何选择，才能使得物品的总价格最高。-The knapsack algorithm descr iption of the problem given a set of items, each item has its own weight and price, the total weight of the limited, how to choose in order to make the highest