oj.uz

Submission #670744

# Submission time Handle Problem Language Result Execution time Memory
670744 2022-12-10T08:08:11 Z zzzzzzzzzzzzzzz 앱 (KOI13_app) Python 3
0 / 21
 948 ms 3300 KB 
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(10001):
    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
0 / 3.15

# Verdict Execution time Memory Grader output
1 Incorrect 99 ms 3156 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 3.15

# Verdict Execution time Memory Grader output
1 Correct 23 ms 3124 KB Output is correct
2 Correct 147 ms 3200 KB Output is correct
3 Incorrect 70 ms 3300 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 3.15

# Verdict Execution time Memory Grader output
1 Incorrect 392 ms 3208 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 3.15

# Verdict Execution time Memory Grader output
1 Incorrect 194 ms 3280 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 3.15

# Verdict Execution time Memory Grader output
1 Incorrect 920 ms 3236 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 3.15

# Verdict Execution time Memory Grader output
1 Incorrect 809 ms 3212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 2.1

# Verdict Execution time Memory Grader output
1 Incorrect 948 ms 3204 KB Output isn't correct
2 Halted 0 ms 0 KB -