📌난이도🥈2

📌코드

import heapq
from heapq import heappush
import sys
input = sys.stdin.readline

heap = []
answer = []
N = int(input())
for i in range(N):
    m = int(input().rstrip())

    if m == 0:
        if heap:
            answer.append(heapq.heappop(heap))
        else:
            answer.append(0)
    else:
        heapq.heappush(heap, m)

for i in answer:
    print(i)

📌후기

heapq 를 사용하면 자바로 풀었던것에 비해 훨씬 쉽다