题解 | 两端问优先队列

import sys
import bisect

#二分查找、插入+有序列表

n = int(input())
s = []

for _ in range(n):
    line = input().split()
    op = int(line[0])
    if op == 1:
        x = int(line[1])
        pos = bisect.bisect_left(s,x)
        s.insert(pos,x)
    
    if op == 2:
        if s:
            print(s[0])
        else:
            print('None')
    
    if op == 3:
        if s:
            print(s[-1])
        else:
            print('None')

    if op == 4:
        if s:
            s.pop(0)
        else:
            print('None')

    if op == 5:
        if s:
            s.pop(-1)
        else:
            print('None')