Submission #670745

#	Time	Username	Problem	Language	Result	Execution time	Memory
670745		zzzzzzzzzzzzzzz	앱 (KOI13_app)	Cpython 3	21 / 21	483 ms	3236 KiB

app

n,m=map(int,input().split())
a=list(map(int,input().split())) #메모리
c=list(map(int,input().split())) #가격
dp=[-999]*10001
dp[0]=0
for i in range(n):
  for j in range(10000,-1,-1):
    if(c[i]+j>10000 or dp[j]<0):continue
    dp[c[i]+j]=max(dp[c[i]+j],dp[j]+a[i])
for i in range(10001):
  if(dp[i]>=m):print(i);break

• Subtask 1: 3.15 / 3.15
• Subtask 2: 3.15 / 3.15
• Subtask 3: 3.15 / 3.15
• Subtask 4: 3.15 / 3.15
• Subtask 5: 3.15 / 3.15
• Subtask 6: 3.15 / 3.15
• Subtask 7: 2.1 / 2.1