[코테] 프로그래머스 - 이중우선순위큐

import heapq

def solution(operations):
    queue = []

    for operation in operations:
        op, num = operation.split(' ')
        num = int(num)

        if op == 'I':
            heapq.heappush(queue, num)
        elif len(queue) > 0:
            if num == 1:
                queue.sort()
                del queue[-1]
            else:
                heapq.heappop(queue)

    if len(queue) == 0:
        return [0, 0]
    elif len(queue) == 1:
        return [queue[0], queue[0]]
    else:
        queue.sort()
        return [queue[-1], queue[0]]
        

# https://school.programmers.co.kr/learn/courses/30/lessons/42628