백준 [ALGORITHM] - 안녕 (1535)

def dp(health, enjoy):
    health = list(map(int, health))
    enjoy = list(map(int, enjoy))

    dp = [0] * 101

    for h, e in zip(health, enjoy):
        if h >= 100:
            continue
        for i in range(99, h - 1, -1):
            dp[i] = max(dp[i], dp[i - h] + e)

    print(max(dp))

n = int(input())
health = input().split()
enjoy = input().split()

dp(health, enjoy)