프로그래머스-더맵게

import java.util.*;
 
class Solution {
    static Queue<Integer> q = new PriorityQueue<>();
    
    public int solution(int[] scoville, int K) {
        for(int i = 0; i<scoville.length; i++){
            q.add(scoville[i]);
        }
        
        int count = 0;
        while(q.peek() < K){
            if(q.size() == 1 && q.peek() < K){
                count = -1;
                break;
            }
            int firstfood = q.poll();
            int secondfood = q.poll();
            int makefood = firstfood + secondfood * 2;
            q.offer(makefood);
            
            count++;
        }
        return count;
    }
}