2131基础解法（Python）

参考代码:

V, m = map(int, input().split())

lst_rec = []

for i in range(m) :

    lst_rec.append([int(i) for i in map(int, input().split())])

dp = [0 for i in range(V+1)]

for i in range(m) :

    for j in range(V, -1, -1) :

        if j >= lst_rec[i][0] :

            dp[j] = max(dp[j], dp[j - lst_rec[i][0]] + lst_rec[i][1])

print(dp[-1])