利用贪心策略解决背包问题。现有载重为M公斤的背包和n种货物。第i种货物的重量为Wi，它的总价值为Pi，假定M、Wi、Pi均为整数。设计程序给出装货方法，使装入背包的货物总价值达到最大。-Greedy strategy to solve the knapsack problem using. Current load of M kg backpack and n kinds of goods. First i kind of cargo weight Wi, its total value of