编程实现背包问题的动态规划算法。

　输入要求：

　第一行：物体个数Ｎ　背包载重量Ｍ　　　　（Ｎ，Ｍ≥１）

　第ｉ行：第i-1个物体的重量 价值（ｉ＝２,3,…,N+1）-Programming the dynamic programming algorithm for knapsack problem. Input requirements: first line: the number of objects N backpack load of M (N, M ≥ 1) the first i-line: the first i-1 the value of the weight of objects (i = 2,3, ..., N+1)