Submission #3937369

Source Code Expand

N, W = map(int, input().split())
dp = [0]*(W+1)
for i in range(N):
    w, v = map(int, input().split())
    for j in range(W, w-1, -1):
        dp[j] = max(dp[j], dp[j-w] + v)
print(max(dp))

Submission Info

Submission Time
Task D - Knapsack 1
User yaketake08
Language PyPy3 (2.4.0)
Score 100
Code Size 196 Byte
Status AC
Exec Time 281 ms
Memory 42348 KiB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 13
Set Name Test Cases
All 0_00, 0_01, 0_02, 1_00, 1_01, 1_02, 1_03, 1_04, 1_05, 1_06, 1_07, 1_08, 1_09
Case Name Status Exec Time Memory
0_00 AC 168 ms 38748 KiB
0_01 AC 159 ms 38256 KiB
0_02 AC 160 ms 38256 KiB
1_00 AC 166 ms 39024 KiB
1_01 AC 280 ms 42348 KiB
1_02 AC 238 ms 41580 KiB
1_03 AC 254 ms 41580 KiB
1_04 AC 268 ms 41580 KiB
1_05 AC 277 ms 41580 KiB
1_06 AC 281 ms 41580 KiB
1_07 AC 266 ms 41580 KiB
1_08 AC 264 ms 41580 KiB
1_09 AC 255 ms 41580 KiB