[Level 2] 더 맵게

import java.util.*;

class Solution {
    public int solution(int[] scoville, int K) {
        int answer = 0;
        PriorityQueue<Integer> pq = new PriorityQueue<>();
        
        for(int s : scoville) { pq.add(s); }
        
        while(pq.size()>=2 && pq.peek()<K) {
            int s1 = pq.poll();
            int s2 = pq.poll();
            int sum = s1+s2*2;
            pq.add(sum);
            answer++;
        }
        
        return pq.peek()>=K ? answer : -1;
    }
}