Submission #4666302

Source Code Expand

N, H = map(int, input().split())
A = []
B =[]
for i in range(N):
    a, b = map(int, input().split())
    A.append(a)
    B.append(b)

maxA = max(A)
cnt = 0
for b in B:
    if b > maxA:
        H -= b
        cnt += 1
        
cnt += - (- H // maxA)

print(cnt)

Submission Info

Submission Time
Task D - Katana Thrower
User Asymmetry
Language Python (3.4.3)
Score 0
Code Size 278 Byte
Status WA
Exec Time 313 ms
Memory 11020 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
AC × 4
AC × 21
WA × 3
Set Name Test Cases
Sample a01, a02, a03, a04
All a01, a02, a03, a04, b05, b06, b07, b08, b09, b10, b11, b12, b13, b14, b15, b16, b17, b18, b19, b20, b21, b22, b23, b24
Case Name Status Exec Time Memory
a01 AC 17 ms 3060 KB
a02 AC 17 ms 3060 KB
a03 AC 17 ms 3060 KB
a04 AC 17 ms 2940 KB
b05 AC 17 ms 3060 KB
b06 AC 313 ms 11020 KB
b07 AC 17 ms 2940 KB
b08 AC 309 ms 11020 KB
b09 AC 17 ms 3060 KB
b10 AC 17 ms 3060 KB
b11 AC 17 ms 3060 KB
b12 AC 17 ms 2940 KB
b13 AC 298 ms 4644 KB
b14 WA 302 ms 4712 KB
b15 AC 283 ms 4648 KB
b16 AC 289 ms 4644 KB
b17 AC 295 ms 10648 KB
b18 AC 292 ms 8300 KB
b19 AC 300 ms 4696 KB
b20 WA 305 ms 4632 KB
b21 WA 309 ms 7640 KB
b22 AC 310 ms 10904 KB
b23 AC 17 ms 2940 KB
b24 AC 23 ms 3188 KB