01背包问题：从这n件物品中选择若干件放入此背包，使得放入的重量之和正好为S。-01 knapsack problem: n items selected from a number of pieces into the bag, so just put the weight of the sum of S.