[Java] Heap (add & peek & poll)

import java.util.PriorityQueue;

public class Solution {
	public int solution(int[] scoville, int K) {
		PriorityQueue<Integer> queue = new PriorityQueue<>();
		for (int i : scoville) {
			queue.add(i);
		}

		int answer = 0;
		while (true) {
			if (queue.peek() >= K) {
				return answer;
			}

			if (queue.size() < 2) {
				break;
			}

			int a = queue.poll();
			int b = queue.poll();

			queue.add(a + b * 2);
			answer++;
		}

		return -1;
	}
}

https://coding-factory.tistory.com/603

[Java] PriorityQueue(우선순위 큐) 클래스 사용법 & 예제 총정리

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

코딩테스트 연습 - 더 맵게