Computer/Coding Test
백준 11286번: 절댓값 힙 구현하기 - Priority Queue, Heap
안녕도라
2023. 10. 18. 20:01
from queue import PriorityQueue
import sys
print = sys.stdout.write
input = sys.stdin.readline
N = int(input())
myQueue = PriorityQueue()
for i in range(N):
request = int(input())
if request == 0:
if myQueue.empty():
print('0\n')
else:
temp = myQueue.get()
print(str((temp[1]))+'\n')
else:
myQueue.put((abs(request),request))