Submission #4074876

---

Source Code Expand

N, W = map(int, input().split())
wv = [list(map(int, input().split())) for i in range(N)]
dp = [[0] * (W+1) for i in range(N+1)]

for i in range(N):
    for j in range(1, W + 1):
        dp[i+1][j] = dp[i][j]
        if 0 <= j - wv[i][0] <= W:
            dp[i+1][j] = max(dp[i][j], dp[i][j - wv[i][0]] + wv[i][1])


print(dp[-1][-1])

Submission Info

Judge Result