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

06.18에 푼 문제입니다.🌷
이중우선순위큐

function solution(operations) {
    var answer = [];
    const queue=[]
    operations.map(operation=>{
        let oper = operation.split(' ')
        if(oper[0]==='I'){
            queue.push(parseInt(oper[1]))
            queue.sort((a,b)=>a-b)
        }
        else{
            if(oper[1]==='1') queue.pop()
            else queue.shift()
        }
    })
    if(queue.length===0) return [0,0]
    answer.push(queue.pop())
    answer.push(queue.shift())
    return answer
}