01背包问题 （python版）

首先是问题描述：给定n种物品和一背包，物品i的重量是wi，其价值是pi，背包的容量是M，问如何选择装入背包中的物品总价值最大？

不用刚好装满

#!/usr/bin/pythonm = int(raw_input("get m as the max bag size:"))n = int(raw_input("get n as the goods tots:"))print("bag max store: %d, goods tots: %d" % (m, n))table = [ [0 for col in range(m+1)] for row in range(n+1)]p = [0]w = [0]for i in range(1, n+1):    weigth = int(raw_input("get weigth:"))    value =  int(raw_input("get val:"))    w.append(weigth)    p.append(value)print pprint w#print tablefor row in range(1, n+1):    for col in range(1, m+1):        if(w[row] <=  col and table[row - 1][col - w[row]]  + p[row] > table[row - 1][col]):                        table[row][col] = table[row - 1][col - w[row]] + p[row]        else:                           table[row][col] = table[row - 1][col]print "max value can store:" + str(table[n][m])