[programmers] 더 맵게(heap)

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

코딩테스트 연습 - 더 맵게

import java.util.PriorityQueue;

class Solution {
    public int solution(int[] scoville, int K) {
        PriorityQueue<Integer> pq = new PriorityQueue<>(scoville.length);
		for (int s : scoville) {
			pq.offer(s);
		}
		int cnt = 0;
		while (!pq.isEmpty() && pq.peek() < K) {
			int min1 = pq.poll();
			if(!pq.isEmpty()) {
				int min2 = pq.poll() * 2;
                if(pq.size() == 1 && min2 < K) {
					return -1;
				}
				pq.offer(min1 + min2);
				cnt++;
			}
		}
        return cnt;
    }
}