[프로그래머스] Lv.2 더 맵게

 

 

[문제]

https://school.programmers.co.kr/learn/courses/30/lessons/42626

프로그래머스

 

 

[소스 코드]

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.offer(s);
        while(pq.size()>1 && pq.peek()<K){
            int a = pq.poll();
            int b = pq.poll() * 2;
            pq.offer(a+b);
            answer++;
        }
        if(pq.peek()<K) return -1;
        return answer;
    }
}