A53 - Priority Queue
https://atcoder.jp/contests/tessoku-book/tasks/tessoku_book_ba
提出
code: python
from collections import
q = int(input())
queries =
list(input().split()) for _ in range(q)
que =
解答
code: python
import heapq
q = int(input())
queries =
list(input().split()) for _ in range(q)
que = []
for q in queries:
if q
0
== "1":
heapq.heappush(que, int(q
1
))
if q
0
== "2":
print(que
0
) # que
1
は 2 番目に小さいとは限らない
if q
0
== "3":
heapq.heappop(que)