[코딩테스트] 더 맵게

문제

 

---

코드

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

int solution(vector<int> scoville, int K) {
	int answer = -1;
	priority_queue<int, vector<int>, greater<int>> qu(scoville.begin(), scoville.end());

	while(!qu.empty())
	{
		int scovilleValue = qu.top();
		qu.pop();

		if (scovilleValue < K)
		{
			if (qu.empty())
				answer++;			
			else
			{
				qu.push(scovilleValue + (qu.top() * 2));
				qu.pop();
				answer++;
			}
		}
		
		if (qu.empty() && scovilleValue < K)
			return -1;

	}

	return answer + 1;
}