[파이썬][프로그래머스] 힙(Heap) 이중우선순위큐

from heapq import heappush, heappop, nlargest
def solution(operations):
    answer = []
    for operation in operations:
        standard, queue = operation.split(' ')
        if standard == 'I':
            heappush(answer, int(queue))
        else:
            if len(answer) == 0:
                pass
            elif len(answer) == 1:
                heappop(answer)
            else:
                if queue == '-1':
                    heappop(answer)
                else:
                    temp = []
                    count = len(answer)
                    for i in range(count-1):
                        heappush(temp, heappop(answer))
                    answer = temp 
                 
    if len(answer) == 0:
        return [0, 0]
    else:
        
        answer = [max(answer), min(answer)]
    return answer