1927번: 최소 힙 (힙) - Fastcampus

www.acmicpc.net/problem/1927

1927번: 최소 힙

import sys
import heapq


# 최소값 순서로 출력 => 힙 이용
def search(a):
    res = []
    qu = []

    for x in a:
        if x > 0:
            heapq.heappush(qu, x)
        else:
            if qu:
                res.append(heapq.heappop(qu))
            else:
                res.append(0)
    return res


N = int(input())
nums = [int(sys.stdin.readline()) for _ in range(N)]

ans = search(nums)
[print(x) for x in ans]