프로그래머스>스택/큐>프린터

import java.util.*;

class Solution 
{
    public int solution(int[] priorities, int location) 
    {
        int answer = 1;
        PriorityQueue<Integer> priorityQueue = new PriorityQueue<>(Collections.reverseOrder());

        for (int priority : priorities) 
        {
            priorityQueue.add(priority);
        }

        while (!priorityQueue.isEmpty()) 
        {
            for (int i = 0; i < priorities.length; i++) 
            {
                if (priorities[i] == priorityQueue.peek()) 
                {
                    if (i == location) 
                 rityQueue.poll();
                    answer++;
                }
            }
        }
        return answer;
    }
}