https://programmers.co.kr/learn/courses/30/lessons/42626 1. 2022.04.08 시도 소요시간: 8분 import java.util.*; class Solution { public int solution(int[] scoville, int K) { PriorityQueue pq = new PriorityQueue(); for (int i=0; i 1 && pq.peek() < K) { int min = pq.poll(); int min2 = pq.poll(); pq.offer(min + (min2 *2)); counter++; } if (pq.peek() < K) { return -1; } return counter; } } 풀이 접근 과정 PriorityQ..