Submission #3791591

---

Source Code Expand

# -*- coding: utf-8 -*-
"""
Created on Sat Dec 15 17:14:09 2018
ABC085D
@author: maezawa
"""
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 True:
    if bsort[0][1] >= h:
        cnt += 1
        break
    if bsort[0][0] <= asort[0][0] and len(bsort)>1:
        cnt += 1
        temp = bsort.pop(0)
        h -= temp[1]
    else:
        h -= asort[0][0]
        cnt += 1
        
print(cnt)
        

Submission Info

Judge Result