大佬可以帮忙看下为什么0-1背包那一题只过了40%吗？ n, m = list(map(int, input().split())) costs = [] profits = [] # print(n) (9255)# print(m) for i in range(n): a, b = list(map(int, input().split())) if a <= m: costs.append(a) profits.append(b) dp = [0]*(m+1) for i in range(1, n): # print(costs[i]) for v in range(m, costs[i], -1): cost = costs[i] profit = profits[i] dp[v] = max(dp[v], dp[v-cost]+profits[i]) print(dp[-1])