[프로그래머스] 더 맵게 - JAVA

문제

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

프로그래머스

 

코드

import java.util.*;

class Solution {
    public int solution(int[] scoville, int K) {
        PriorityQueue<Integer> pq = new PriorityQueue<>();
        for(int i=0;i<scoville.length;i++){
            pq.add(scoville[i]);
        }
        
        int count = 0;
        while(true){
            int min = pq.peek();
            if(min >= K) return count;
            if(pq.size() == 1) return -1;
            int a = pq.poll();
            int b = pq.poll();
            pq.add(a + b*2);
            count += 1;
        }

    }
}