import math as m
import time
import heapq

n = int(input())
que = []
while (n:=n-1)+1:
    line = input().split()
    op = int(line[0])
    if op == 1:
        x = eval(line[1])
        heapq.heappush(que, x)
    elif op == 2:
        tmp = heapq.heappop(que)
        print(tmp)
        heapq.heappush(que, tmp)
    else:
        heapq.heappop(que)

代码如上，从第8个点开始全T了 我自己测了一下，用python跑1000000的数据要三四秒，没想到真的比C++慢这么多