We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
2 parents ba15714 + 2a31104 commit 6666f5aCopy full SHA for 6666f5a
1 file changed
LiiNi-coder/202511/18 PGM 프로세스.md
@@ -0,0 +1,38 @@
1
+```java
2
+import java.util.*;
3
+
4
+class Solution {
5
+ public int solution(int[] priorities, int location) {
6
+ PriorityQueue<Integer> pq = new PriorityQueue<>( Collections.reverseOrder());
7
+ for(int p : priorities){
8
+ pq.offer(p);
9
+ }
10
+ int printedCount = 0;
11
+ Deque<int[]> queue = new ArrayDeque<>();
12
+ for(int i = 0; i < priorities.length; i++){
13
+ queue.offerLast(new int[]{ i, priorities[i] });
14
15
16
+ while(!queue.isEmpty()){
17
+ int[] now = queue.pollFirst();
18
+ int index = now[0];
19
+ int pri = now[1];
20
21
+ if(pri == pq.peek()){
22
+ pq.poll();
23
+ printedCount++;
24
+ if(index == location){
25
+ return printedCount;
26
27
28
29
+ //다시 큐 보내기
30
+ else {
31
+ queue.offerLast(now);
32
33
34
35
36
+}
37
38
+```
0 commit comments