프로그래머스: 이중 우선 순위 큐

import heapq
def solution(operations):
    answer = []
    h = []
    for operation in operations:
        opt, num = operation.split(' ')
        if opt == 'I':
            heapq.heappush(h, int(num))
        else:
            if num == '-1':
                if h:
                    heapq.heappop(h)
            # 최대 값 삭제
            else:
                if h:
                    h.pop(h.index(max(h)))
                    heapq.heapify(h)
    if not h:
        return [0, 0]
    else:
        return [max(h), h[0]]
    return answer