[Heap] programmers-이중우선순위큐

Author: Seogeurim

README.md

@@ -112,6 +112,8 @@
 | :-: | :-: | :-------------------------------------- | :------------------------------- |
 | 01  |     | [Baekjoon-10845 큐](./src/Queue/P10845) |                                  |
 | 02  |     | [Baekjoon-3190 뱀](./src/Queue/P3190)   | Deque / 삼성 SW 역량 테스트 기출 |
+| 03  |     | [Programmers 디스크 컨트롤러](src/Queue/prg42627) |  Priority Queue    |
+| 04  |     | [Programmers 이중우선순위큐](src/Queue/prg42628)  |   Priority Queue   |
 
 ### Tree
 
@@ -127,7 +129,6 @@
 | 02  |     | [Baekjoon-1927 최소 힙](./src/Heap/P1927)   |      |
 | 03  |     | [Baekjoon-11279 최대 힙](./src/Heap/P11279) |      |
 | 04  |     | [Programmers 더 맵게](./src/Heap/prg42626) |      |
-| 05  |     | [Programmers 디스크 컨트롤러](./src/Heap/prg42627) |      |
 
 ### Indexed Tree (Segment Tree)
 

src/Heap/prg42627/Main.java renamed to src/Queue/prg42627/Main.java

@@ -1,4 +1,4 @@
-package Heap.prg42627;
+package Queue.prg42627;
 
 import java.util.Arrays;
 import java.util.PriorityQueue;

src/Heap/prg42627/README.md renamed to src/Queue/prg42627/README.md

@@ -0,0 +1,46 @@
+package Queue.prg42628;
+
+import java.util.*;
+
+public class Main {
+    public static void main(String[] args) {
+        Solution sol = new Solution();
+        System.out.println(Arrays.toString(sol.solution(new String[]{"I 16", "D 1"})));
+        // [0, 0]
+        System.out.println(Arrays.toString(sol.solution(new String[]{"I 16", "I -5643", "D -1", "D 1", "D 1", "I 123", "D -1"})));
+        // [0, 0]
+        System.out.println(Arrays.toString(sol.solution(new String[]{"I 7", "I 5", "I -5", "D -1"})));
+        // [7, 5]
+        System.out.println(Arrays.toString(sol.solution(new String[]{"I -45", "I 653", "D 1", "I -642", "I 45", "I 97", "D 1", "D -1", "I 333"})));
+        // [333, -45]
+    }
+}
+
+class Solution {
+    public int[] solution(String[] operations) {
+        PriorityQueue<Integer> pqMin = new PriorityQueue<>(((o1, o2) -> o1 - o2));
+        PriorityQueue<Integer> pqMax = new PriorityQueue<>(((o1, o2) -> o2 - o1));
+
+        for (String op : operations) {
+            StringTokenizer st = new StringTokenizer(op);
+            char cmd = st.nextToken().charAt(0);
+            int num = Integer.parseInt(st.nextToken());
+
+            if (cmd == 'I') {
+                pqMin.add(num);
+                pqMax.add(num);
+            } else if (cmd == 'D' && !pqMin.isEmpty()) {
+                if (num == 1) {
+                    int target = pqMax.poll();
+                    pqMin.remove(target);
+                } else if (num == -1) {
+                    int target = pqMin.poll();
+                    pqMax.remove(target);
+                }
+            }
+        }
+
+        if (pqMin.isEmpty()) return new int[]{0, 0};
+        else return new int[]{pqMax.peek(), pqMin.peek()};
+    }
+}

src/Queue/prg42628/Main.java

@@ -0,0 +1,3 @@
+## [programmers - 힙(Heap)] 이중우선순위큐
+
+![image](https://user-images.githubusercontent.com/22045163/106357160-b4ad0d80-6347-11eb-943e-46361de1664f.png)