[Programmers] 이중우선순위큐(Lv 3, JavaScript)

[ 소스 코드 ]

function solution(operations) {
    let deque = [];
    operations.forEach((oper) => {
        let [action, N] = oper.split(" ");
        if (action === "I") {
            deque.push(parseInt(N));
            deque.sort((o1, o2) => o1 - o2); 
        } else {
            if (deque.length === 0) return;
            N === "1" ? deque.pop() : deque.shift();
        }
    });
    return [deque.at(-1) ? deque.at(-1) : 0
            , deque[0] ? deque[0] : 0];
}