1962. 移除石子使总数最小

1962. 移除石子使总数最小

• 难度: medium
• 原始链接: https://leetcode.cn/problems/remove-stones-to-minimize-the-total
• 标签: 优先队列

解法一: 优先队列

java

class Solution {
    public int minStoneSum(int[] piles, int k) {
        PriorityQueue<Integer> priorityQueue = new PriorityQueue<>((num1, num2) -> num2 - num1);
        for (int pile : piles) {
            priorityQueue.offer(pile);
        }
        for (int i = 0; i < k; i++) {
            priorityQueue.offer((priorityQueue.poll() + 1) >> 1);
        }
        int sum = 0;
        for (Integer num : priorityQueue) {
            sum += num;
        }
        return sum;
    }
}