Submission #4064915


Source Code Expand

n,h = map(int,input().split())

A = []
B = []
for _ in range(n):
    a,b = map(int,input().split())
    A.append(a)
    B.append(b)
maxA = max(A)
B.sort(reverse=True)

cnt = 0
for i in range(n):
    if B[i] >= maxA:
        h -= B[i]
        cnt += 1
    else:
        break

if h <= 0:
    print(cnt)
elif h % maxA == 0:
    print(h//maxA + cnt)
else:
    print(h//maxA + 1 + cnt)

Submission Info

Submission Time
Task D - Katana Thrower
User abab
Language Python (3.4.3)
Score 0
Code Size 405 Byte
Status WA
Exec Time 351 ms
Memory 11344 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
AC × 4
AC × 18
WA × 6
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 18 ms 3064 KB
a02 AC 18 ms 3064 KB
a03 AC 17 ms 3064 KB
a04 AC 18 ms 3060 KB
b05 AC 18 ms 3064 KB
b06 WA 334 ms 11020 KB
b07 AC 18 ms 3064 KB
b08 WA 338 ms 10936 KB
b09 AC 18 ms 3064 KB
b10 AC 17 ms 3064 KB
b11 AC 18 ms 3064 KB
b12 AC 18 ms 3064 KB
b13 AC 310 ms 4644 KB
b14 WA 310 ms 4752 KB
b15 WA 307 ms 4752 KB
b16 AC 315 ms 4644 KB
b17 AC 326 ms 10964 KB
b18 AC 316 ms 8744 KB
b19 AC 326 ms 5104 KB
b20 WA 325 ms 5092 KB
b21 WA 348 ms 7996 KB
b22 AC 351 ms 11344 KB
b23 AC 18 ms 3064 KB
b24 AC 24 ms 3188 KB