Submission #6978028

---

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)

b_list.sort(reverse=True)

ans = 0

for i in b_list:
    H -= i
    ans += 1
    if H > 0:
        pass
    elif H  == 0:
        break
    elif H < 0:
        break

if H > 0:
    ans += ceil(H, x)

print(ans) 

Submission Info

Judge Result