もっと辛い(java)

説明する

import java.util.PriorityQueue;
class Solution {
    public int solution(int[] scoville, int K) {
        int ans = 0;
        PriorityQueue<Integer> heap = new PriorityQueue<>();
        
        for( int i : scoville) heap.offer(i);
        
        while(heap.peek() < K){
            if(heap.size() == 1) return -1;
            
            int a = heap.poll();
            int b = heap.poll();
            int sum = a + ( b * 2 );
            heap.offer(sum);
            ans++;
        }
        return ans;
    }
}