코드 function solution(priorities, location) { let count = 1; priorities = priorities.map((ele, index) => [index, ele]); while (true) { let max = priorities[0][1]; for (let i = 1; i = max) { if (priorities[0][0] === location) return count; priorities.shift(); count++; } else { priorities.push(pr..