이중우선순위큐

import bisect
def solution(operations):
    answer = []
    for operation in operations :
        order, num = operation.split(' ')
        if order == 'I' :
            bisect.insort_left(answer, int(num))
        elif answer :
            if num == '-1' :
                answer.pop(0)
            else :
                answer.pop(-1)
    return [answer[-1], answer[0]] if answer else [0, 0]