给定一个最大载重量为M的卡车和N种食品。已知第 i 种食品的最多拥有Wi 公斤，其商品价值为Vi元/公斤，编程确定一个装货方案，使得装入卡车中的所有物品总价值最大。-Greedy algorithm to solve the knapsack problem, given a maximum load of M trucks and N kinds of food. Known I kinds of food with a maximum of Wi kg, its commodity value of Vi yuan/kg, programming to determine a loading program, so that the total value of all items loaded into the truck.