이슈 #408에서 솔루션 추가

Programmers/더_맵게.cpp

@@ -0,0 +1,28 @@
+#include <string>
+#include <vector>
+#include <queue>
+
+using namespace std;
+
+int solution(vector<int> scoville, int K) {
+    priority_queue<int, vector<int>, greater<int>> pq;
+
+    for (int s : scoville) {
+        pq.push(s);
+    }
+
+    int mixCount = 0;
+
+    while (pq.size() >= 2 && pq.top() < K) {
+        int first = pq.top();
+        pq.pop();
+        int second = pq.top();
+        pq.pop();
+
+        int newScoville = first + (second * 2);
+        pq.push(newScoville);
+        mixCount++;
+    }
+
+    return (pq.top() >= K) ? mixCount : -1;
+}