public int solution(int[] priorities1, int location1) {
int result = 0;
//1
Queue<Integer> pq = new PriorityQueue<Integer>(Collections.reverseOrder());
for(int prioritie : priorities1) {
pq.offer(prioritie);
}
//2
while(!pq.isEmpty()) {
for(int i=0; i<priorities1.length; i++) {
if(pq.peek() == priorities1[i]) {
pq.poll();
result++;
if(location1 == i) {
pq.clear();
break;
}
}
}
}
return result;
}
new PriorityQueue(Collections.reverseOrder())로 생성할 경우 역배열 정렬 시켜준다.