[백준] 1535번 안녕 (파이썬)

https://www.acmicpc.net/problem/1535

n = int(input())
L = [0] + list(map(int, input().split()))
H = [0] + list(map(int, input().split()))

dp = [[0]*101 for _ in range(n+1)]

for i in range(1, n+1):
    l, h = L[i], H[i]
    for j in range(1, 101):
        if j < l:
            dp[i][j] = dp[i-1][j]
        else:
            dp[i][j] = max(dp[i-1][j], dp[i-1][j-l] + h)
            
print(dp[n][99])