[백준] 7579번 앱 (파이썬)

7579번: 앱

 

코드

import sys

n, m = map(int, input().split(" "))
active_li = list(map(int, sys.stdin.readline().split(" ")))
cost_li = list(map(int, sys.stdin.readline().split(" ")))
dp_li = [[0]*(sum(cost_li)+1) for _ in range(n+1)]
answer_li = []

for i in range(1,n+1):
    for j in range(1, sum(cost_li)+1):
        if cost_li[i-1] <= j:
            dp_li[i][j] = max(dp_li[i-1][j], active_li[i-1]+dp_li[i-1][j-cost_li[i-1]])
        else:
            dp_li[i][j] = dp_li[i-1][j]
        
        if dp_li[i][j] >= m:
            answer_li.append(j)

print(min(answer_li))