Python求解背包问题

解题思路:

注意事项:

参考代码:

n,m=map(int,input().split())
w=[0]*(n+1)
v=[0]*(n+1)
for i in range(1,n+1):
   w[i],v[i]=map(int,input().split())
dp =[[0 for i in range(m+1)] for j in range(n+1)]
for i in range(1,n+1):
   for j in range(1,m+1):
       if w[i]<=j:
           dp[i][j]=max(dp[i-1][j],dp[i-1][j-w[i]]+v[i])
       else:
           dp[i][j]=dp[i-1][j]
print(dp[n][m])