더 맵게 (자바)

package prog;

import java.util.PriorityQueue;
import java.util.Queue;

public class 더맵게 {
    public static void main(String[] args) {
        Solution_더맵게 s = new Solution_더맵게();
        System.out.println(s.solution(new int[] {1, 2, 3, 9, 10, 12},7));
    }
}

class Solution_더맵게 {
    public int solution(int[] scoville, int K) {
        int answer = 0;
        Queue<Integer> pq = new PriorityQueue<>();
        for (int i : scoville) {
            pq.add(i);
        }
        while(true){
            if(pq.size()<2 || pq.peek()>=K){
                break;
            }
            else{
                int a = pq.poll();
                int b = pq.poll();
                int result = a+ b*2;
                pq.add(result);
                answer++;
            }
        }
        if(pq.peek()<K){
            return -1;
        }
        return answer;
    }
}