说明：  0-1背包问题 将计算出的装入背包物品的最大价值和最优装入方案输出。第一行输出为：Optimal value is
(0-1 knapsack problem will be calculated into the knapsack to maximize the value of goods and optimum output load program. The first line of output: Optimal value is)