[level 2] Title: 프로세스, Time: 1.80 ms, Memory: 73.1 MB -BaekjoonHub

Author: wonseokyoon

프로그래머스/2/42587. 프로세스/README.md

@@ -4,7 +4,7 @@
 
 ### 성능 요약
 
-메모리: 89.1 MB, 시간: 1.57 ms
+메모리: 73.1 MB, 시간: 1.80 ms
 
 ### 구분
 
@@ -16,7 +16,7 @@
 
 ### 제출 일자
 
-2025년 07월 14일 12:31:13
+2025년 09월 01일 22:26:05
 
 ### 문제 설명
 

프로그래머스/2/42587. 프로세스/프로세스.java

@@ -1,24 +1,51 @@
 import java.util.*;
 class Solution {
+    class Status {
+        int priority;
+        int location;
+        
+        public Status(int priority, int location){
+            this.priority = priority;
+            this.location = location;
+        }
+        
+        @Override
+        public String toString(){
+            return "[" + priority + "," + location +"]";
+        }
+    }
+    
     public int solution(int[] priorities, int location) {
-        PriorityQueue<Integer> pq = new PriorityQueue<>(Collections.reverseOrder());    // 우선순위 큐(역순)
-        int cnt = 0;
-        for(int num : priorities){
-            pq.add(num);    // 큐에 값 등록
+        Queue<Status> queue = new LinkedList<>();
+        List<Integer> list = new ArrayList<>();
+        int i = 0;
+        for(int priority : priorities){
+            Status status = new Status(priority,i++);
+            queue.offer(status);
+            list.add(priority);
         }
-
-        while (!pq.isEmpty()) {
-            for(int i=0; i<priorities.length;i++){
-                if(pq.peek() == priorities[i]){
-                    pq.poll();
-                    cnt++;
-
-                    if(location == i){
-                        return cnt;
-                    }
-                }
+        
+        // 정렬
+        Collections.sort(list,Collections.reverseOrder());
+        
+        int cnt = 1;
+        while(!queue.isEmpty()){
+            Status status = queue.poll();
+            int priority = status.priority;
+            int idx = status.location;
+            int target = list.get(0);
+            
+            if(target == priority) {
+                list.remove(0);    // 삭제
+                if(location == idx) return cnt;
+                cnt ++;
+            } else{
+                queue.offer(status);
             }
         }
-        return cnt;
+        
+        
+        int answer = 0;
+        return answer;
     }
 }