Algorithm/boj

[파이썬] 11000 강의실 배정

takeU 2022. 7. 6. 09:46
반응형
from heapq import heappush, heappop
import sys
input = sys.stdin.readline

n = int(input())
q = sorted([list(map(int, input().split())) for _ in range(n)])
h = []
heappush(h, q[0][1] )

for i in range(1, n):
    if q[i][0] < h[0]:
        heappush(h, q[i][1])
    else:
        heappop(h)
        heappush(h, q[i][1])

print(len(h))

힙, 그리디