初来咋到，感觉洛谷对Python3不是很友好？还是我太菜，Python3过的话必须要手写堆吗？求教！

## 只有56分，过了7/12个用例，还有单调栈模板的题目也是TLE，自闭了
import heapq

stack = []
n = int(input())
for _ in range(n):
    lst = [int(num) for num in input().split()]
    if len(lst) == 2:
        heapq.heappush(stack, int(lst[1]))
    elif lst[0] == 2:
        print(stack[0])
    else:
        heapq.heappop(stack)