[Python] 백준 11000번: 강의실 배정

문제

https://www.acmicpc.net/problem/11000

11000번: 강의실 배정

 

풀이

import heapq

N = int(input())
C = []
h = []
for i in range(N):
    C.append(list(map(int, input().split())))

C = sorted(C,key = lambda x: x[0])
for i in range(N):
    if len(h) != 0 and h[0]<= C[i][0]:
        heapq.heappop(h)
    heapq.heappush(h,C[i][1])
print(len(h))