[프로그래머스] / [Level 3] / [Python] 이중우선순위 큐

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

프로그래머스

---

Heap 모듈을 사용해서 해결하였다.

import heapq
def solution(operations):
    answer = []
    
    h = []
    
    for oper in operations:
        order, index = oper.split(' ')        
        index = int(index)
        
        if order == 'I':
            heapq.heappush(h, index)
        else:
            if h:
                if index == 1:
                    h.remove(max(h))
                elif index == -1:
                    heapq.heappop(h)
    if h:
        answer.append(max(h))
        answer.append(heapq.heappop(h))
    else:
        answer = [0, 0]
    
    return answer