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

def solution(operations):
    q = []
    for command in operations:
        if command[0] == "I":
            q.append(int(command[2:len(command)]))
        elif command == "D -1":
            if len(q) > 0:
                q.remove(min(q))
        else:
            if len(q) > 0:
                q.remove(max(q))
    if len(q) > 0:
        answer = [max(q), min(q)]
    else:
        answer = [0, 0]
    return answer

반례가 있을줄 알았는데 다행히 통과했다

 

화이팅!!