C语言结构化实现贪心算法，利用贪心策略解决背包问题。现有载重为M公斤的背包和n种货物。第i种货物的重量为Wi，它的总价值为Pi，假定M、Wi、Pi均为整数。设计程序给出装货方法，使装入背包的货物总价值达到最大-Using the greedy strategy to solve knapsack problem. Existing load for M kg backpack and n kinds of goods. The kind of the weight of the goods as I Wi, the total value of it as the Pi, M, Wi, Pi are assumed to be an integer. Design procedure is given loading method, make the goods loaded backpack maximum total value