Submission #6978531


Source Code Expand

#!/usr/bin/env python3
#ABC85 D

import sys
import math
import bisect
sys.setrecursionlimit(1000000000)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))


n,h = LI()
maxa = 0
ab = []
for _ in range(n):
    a,b = LI()
    maxa = max(maxa,a)
    ab.append([a,b])
x = sorted(ab,key = lambda x:x[1],reverse = True)
cnt = 0
for i in range(n):
    a,b = x[i]
    if maxa <= b:
        h -= b
        cnt += 1
    if h <= 0:
        print(cnt)
        quit()
cnt += math.ceil(h / maxa)
print(cnt)

Submission Info

Submission Time
Task D - Katana Thrower
User nrkt
Language PyPy3 (2.4.0)
Score 400
Code Size 864 Byte
Status AC
Exec Time 420 ms
Memory 59868 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 175 ms 38512 KB
a02 AC 176 ms 38384 KB
a03 AC 171 ms 38256 KB
a04 AC 173 ms 38256 KB
b05 AC 169 ms 38256 KB
b06 AC 355 ms 59868 KB
b07 AC 169 ms 38256 KB
b08 AC 352 ms 59228 KB
b09 AC 174 ms 38384 KB
b10 AC 170 ms 38256 KB
b11 AC 170 ms 38256 KB
b12 AC 171 ms 38256 KB
b13 AC 314 ms 59100 KB
b14 AC 331 ms 59612 KB
b15 AC 329 ms 59740 KB
b16 AC 332 ms 59868 KB
b17 AC 420 ms 59612 KB
b18 AC 405 ms 59612 KB
b19 AC 356 ms 59484 KB
b20 AC 379 ms 59484 KB
b21 AC 409 ms 59612 KB
b22 AC 408 ms 59740 KB
b23 AC 169 ms 38256 KB
b24 AC 185 ms 40176 KB