힙(Heap) > 더 맵게

https://programmers.co.kr/learn/courses/30/lessons/42626

1. 문제

2. 알고리즘

키워드 - 힙

3. 코드

#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <queue>
 
using namespace std;
 
int solution(vector<int> scoville, int K) {
    int answer = 0;
 
    priority_queue<int, vector<int>, greater<int>> q;
    for (int i = 0; i < scoville.size(); i++) {
        q.push(scoville[i]);
    }
 
    while (true) {
 
        int a = q.top(); 
        if (a >= K) {
            break;
        }
        
        if(q.size() == 1) {
            answer = -1;
            break;
        }
        
        q.pop();
        int b = q.top(); 
        
        q.pop();
 
        int cand = a + (b * 2);
        q.push(cand);
 
        answer++;
    }
    return answer;
}