Submission #6977899

---

Source Code Expand

import math
N, H = map(int, input().split())
a = [0] * N
b = [0] * N
for i in range(N):
    a[i], b[i] = map(int, input().split())

def ceil(s, t):
    if s%t == 0:
        return s//t
    else:
        return s//t + 1


x = max(a)
b_list= []
for i in range(N):
    if b[i] > x :
        b_list.append(b[i])

y = sum(b_list)

ans = ceil(H-y,x) + len(b_list)
#print(H, y, x, len(b))
#print(b_list)

print(ans)

Submission Info

Judge Result