原创的背包算法原程序。n个物品，对物品i，价值为p[i]，质量为w[i]，背包容量为W。如何选取物品装入背包，使背包中的物品的总价值最大。 -Original algorithm for the original procedure backpack. n of items, on item i, the value of p [i], the quality of w [i], knapsack capacity W. How to select the items into the ba