힙 - 더맵게 우선순위 큐 사용

#include <string>
#include <vector>
#include <queue>
using namespace std;

int solution(vector<int> scoville, int K) {

	int answer = 0;
	int sum = 0;
    
	priority_queue<int, vector<int>, greater<int> > pq(scoville.begin(), scoville.end());
	
	while(1)
	{
		sum = 0;
		if(pq.top()>K)
		{
			return answer;
			break;
		}
		if(pq.size()==1&&pq.top()<K)
		{
			return -1;
		}
		int first = pq.top();
		pq.pop();
		int second = pq.top();
		pq.pop();
		sum = first + (second*2);
		pq.push(sum);
		answer++;
	}
	
}