贪心方法解0/1背包问题,构造一个物品类,调用类方法对背包进行排序,核心代码已给出-greedy method for 0/1 knapsack problem, a structural categories of goods, the category called right backpack method for sequencing, the core code has been given