프로그래머스 프린터

import java.util.Comparator; import java.util.PriorityQueue; public class StackQueue01 { class Solution { public int solution(int[] priorities, int location) { int answer = 1; PriorityQueue<Integer> queue = new PriorityQueue<>(Comparator.reverseOrder()); for (int i : priorities) { queue.offer(i); } while (!queue.isEmpty()) { for (int i = 0; i < priorities.length; i++) { if (priorities[i] == queue.peek()) { if (location == i) { return answer; } answer++; queue.poll(); } } } return answer; } } }