updated at 2022. 12. 1. 오후 4:46:06

programmers/명예의 전당 (1)/solution.java

@@ -1,27 +1,17 @@
 // [문제 링크]: https://school.programmers.co.kr/learn/courses/30/lessons/138477
 
-import java.util.ArrayList;
+import java.util.*;
-import java.util.Collections;
+
 class Solution {
     public int[] solution(int k, int[] score) {
-        int[] answer2 = {};
+        int l = score.length;
-        ArrayList <Integer> answer = new ArrayList();
+        int[] answer = new int[l];
-        ArrayList <Integer> hall = new ArrayList();
+        PriorityQueue<Integer> que1 = new PriorityQueue<>();
-        for(int i = 0; i < score.length; i++){
+        for (int i = 0; i < l; i++){
-            if(i > k-1){
+            que1.add(score[i]);
-                if(score[i] > hall.get(0)){
+            if(que1.size() > k) que1.poll();
-                    hall.add(score[i]);
+            answer[i] = que1.peek();
-                    hall.remove(hall.get(0));
-                }
-            }
-            else hall.add(score[i]);
-            Collections.sort(hall);
-            answer.add(hall.get(0));
         }        
-        answer2 = new int[answer.size()];
+        return answer;
-        for (int i = 0; i < answer.size(); i++) {
-            answer2[i] = answer.get(i);
-        }
-        return answer2;
     }
 }