[힙] 이중우선순위큐

import heapq

def solution(operations):
    answer = []
    
    for o in operations:
        if o=="D 1":
            if not answer: continue
            answer.pop()
        elif o=="D -1": 
            if not answer: continue
            heapq.heappop(answer)
        else: heapq.heappush(answer, int(o[2:]))
    
    answer.sort()
    
    if answer: return [answer[-1], answer[0]]
    else: return [0, 0]

heappush만 하게 되면 정렬이 되지 않으므로 정렬 따로 필요