[백준][골드5][12865] 평범한 배낭

import sys input = sys.stdin.readline n, k = map(int, input().split()) dp = [0] * (k+1) for _ in range(n): w, v = map(int, input().split()) for i in range(k, w-1, -1): dp[i] = max(dp[i], dp[i-w] + v) #print(i, w, dp) print(dp[k])