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

programmers.co.kr/learn/courses/30/lessons/42628

 

def solution(operations):
    q=[]
    o=[]
    for i in range(len(operations)):
        o.append(operations[i].split())


    for action, x in o:
        if action == 'I':
            q.append(int(x))
        elif action == 'D':
            if len(q)==0:
                continue
            elif x == '1':
                q.__delitem__(q.index(max(q)))
            elif x== '-1':
                q.__delitem__(q.index(min(q)))
        print(q)

    if len(q)==0:
        return [0,0]
    else:
        return [int(max(q)), int(min(q))]