Submission #3792026

---

Source Code Expand

# -*- coding: utf-8 -*-
"""
Created on Sat Dec 15 17:14:09 2018
ABC085D
@author: maezawa
"""
import math
n, h = list(map(int, input().split()))
ab = []
for i in range(n):
    x=list(map(int, input().split()))
    x.append(i)
    ab.append(x)
    
bsort = sorted(ab,key=lambda x: x[1], reverse=True)
asort = sorted(ab,key=lambda x: x[0], reverse=True)

cnt = 0
while len(bsort) >= 1:
    #print(h)
    if bsort[0][1] > asort[0][0]:
        cnt += 1
        temp = bsort.pop(0)
        h -= temp[1]
    else:
        break

c = math.ceil(h / asort[0][0])
h -= c*asort[0][0]
cnt += c
#print(h)
        
print(cnt)
        

Submission Info

Judge Result