用vc6.0解决背包问题。给定 n 种物品和一背包。物品 i 的重量是 wi，其价值为 pi，背包的容量为 m。问应如何选择装入背包中的物品，使得装入背包中物品的总价值最大-Solve the knapsack problem with vc6.0. Species of a given n items and a backpack. The weight of item i is wi, the value of pi, the capacity of backpack m. Asked should be how to choose the items into the backpack, the backpack load in the largest total value of goods