10.求解完全背包问题 - 蓝桥云课 (lanqiao.cn)
import os
import sys
# 请在此输入您的代码
taotal_w,n=map(int,input().split())
w=[]
v=[]
dp=[0]*(taotal_w+1) #物品无限使用不用考虑
for i in range(n):
wi,vi=map(int,input().split())
w.append(wi)
v.append(vi)
for i in range(n):
for j in range(w[i],taotal_w+1):
dp[j]=max(dp[j],dp[j-w[i]]+v[i])
print(dp[taotal_w])