Submission #4065038


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:
        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 400
Code Size 441 Byte
Status AC
Exec Time 361 ms
Memory 11352 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 4
AC × 24
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 18 ms 3060 KB
a04 AC 18 ms 3064 KB
b05 AC 18 ms 3060 KB
b06 AC 307 ms 11036 KB
b07 AC 18 ms 3060 KB
b08 AC 308 ms 11016 KB
b09 AC 18 ms 3064 KB
b10 AC 18 ms 3064 KB
b11 AC 18 ms 3064 KB
b12 AC 18 ms 3064 KB
b13 AC 322 ms 4644 KB
b14 AC 310 ms 4640 KB
b15 AC 278 ms 4632 KB
b16 AC 280 ms 4764 KB
b17 AC 342 ms 11032 KB
b18 AC 317 ms 8760 KB
b19 AC 326 ms 5068 KB
b20 AC 327 ms 5108 KB
b21 AC 361 ms 8052 KB
b22 AC 357 ms 11352 KB
b23 AC 18 ms 3064 KB
b24 AC 25 ms 3188 KB