[BOJ 1927] 최소힙

Heap

[BOJ 1927] 최소힙

문제

구조화

예제 시각화

해답

import heapq as hq
import sys
input = sys.stdin.readline
n=int(input())
min_heap = []
hq.heapify(min_heap)
cmd = []
for i in range(n):
    cmd.append(int(input()))
for i in cmd:
    if i==0:
        if len(min_heap)==0: # empty case
            print(0)
        else:
            target = hq.heappop(min_heap) # root 노드 제거 
            print(target) # 출력
    else:
        hq.heappush(min_heap,i) # insert