oj.uz

Submission #670740

# Submission time Handle Problem Language Result Execution time Memory
670740 2022-12-10T08:01:33 Z zzzzzzzzzzzzzzz 앱 (KOI13_app) Python 3
0 / 21
 774 ms 3228 KB 
n,m=map(int,input().split())
a=list(map(int,input().split())) #메모리
c=list(map(int,input().split())) #가격
dp=[0]*10001
dp[0]=0
for i in range(n):
  for j in range(10001):
    if(c[i]+j>10000):break
    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 87 ms 3200 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 3.15

# Verdict Execution time Memory Grader output
1 Correct 28 ms 3108 KB Output is correct
2 Correct 143 ms 3228 KB Output is correct
3 Incorrect 69 ms 3204 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 3.15

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

Subtask #4
0 / 3.15

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

Subtask #5
0 / 3.15

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

Subtask #6
0 / 3.15

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

Subtask #7
0 / 2.1

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