add PROGRAMMERS-42626

Author: codejsha

README.md

@@ -29,6 +29,7 @@
 | PROGRAMMERS-42578         | [python](programmers/problem42578) | [의상 (Clothes)](https://school.programmers.co.kr/learn/courses/30/lessons/42578)                                                     |
 | PROGRAMMERS-42586         | [java](programmers/problem42586)   | [기능개발 (Function Development)](https://school.programmers.co.kr/learn/courses/30/lessons/42586)                                    |
 | PROGRAMMERS-42587         | [java](programmers/problem42587)   | [프로세스 (Process)](https://school.programmers.co.kr/learn/courses/30/lessons/42587)                                                 |
+| PROGRAMMERS-42626         | [java](programmers/problem42626)   | [더 맵게 (Spicier)](https://school.programmers.co.kr/learn/courses/30/lessons/42626)                                                  |
 | PROGRAMMERS-42628         | [java](programmers/problem42628)   | [이중우선순위큐 (Double-Ended Priority Queue)](https://school.programmers.co.kr/learn/courses/30/lessons/42628)                       |
 | PROGRAMMERS-42842 :star:  | [java](programmers/problem42842)   | [카펫 (Carpet)](https://school.programmers.co.kr/learn/courses/30/lessons/42842)                                                      |
 | PROGRAMMERS-42883         | [c++](programmers/problem42883)    | [큰 수 만들기 (Make a Big Number)](https://school.programmers.co.kr/learn/courses/30/lessons/42883)                                   |

programmers/problem42626/Spicier.java

@@ -0,0 +1,36 @@
+package problem42626;
+
+import java.util.PriorityQueue;
+
+public class Spicier {
+    public static void main(String[] args) {
+        var sol = new Spicier();
+        var scoville1 = new int[]{1, 2, 3, 9, 10, 12};
+        var K1 = 7;
+        var expected1 = 2;
+        var result1 = sol.solution(scoville1, K1);
+        System.out.println("expected: " + expected1 + ", result: " + result1);
+    }
+
+    public int solution(int[] scoville, int K) {
+        var queue = new PriorityQueue<Integer>();
+        for (var i : scoville) {
+            queue.add(i);
+        }
+
+        var mixCount = 0;
+        while (queue.size() >= 2 && queue.peek() < K) {
+            var first = queue.poll();
+            assert queue.peek() != null;
+            var second = queue.poll();
+            queue.add(first + second * 2);
+            mixCount++;
+        }
+
+        if (queue.size() == 0 || queue.peek() < K) {
+            return -1;
+        }
+
+        return mixCount;
+    }
+}