Minimum Steps to Halve Sum

JavaView on GFG

Problem Overview

Minimum operations to reduce array sum by half, each operation halves one element.

See our study guide for structured GFG and LeetCode practice.

Intuition

Minimum operations to reduce array sum by half, each operation halves one element. Max-heap greedy.

Algorithm

1Max-heap. Repeatedly halve the largest element. Count operations until totalReduced >= initialSum/2.

Common Pitfalls

• Same as LC 2208. Greedy: always halve the largest. Use max-heap with floating point values. O(n log n).

Minimum Steps to Halve Sum.java

Java

// Approach: Greedy with max-heap. Always halve the largest element; accumulate savings until total >= sum/2.
// Time: O(n log n) Space: O(n)
import java.util.*;

class Solution {
    public int minOperations(int[] arr) {
        PriorityQueue<Double> maxPq = new PriorityQueue<>(Collections.reverseOrder());

        double sum = 0;

        for (int i = 0; i < arr.length; i++) {
            sum += arr[i];
            maxPq.add((double) arr[i]);
        }
        double half = sum / 2;
        int minOperation = 0;

        while (sum > half) {
            double maxVal = maxPq.poll();
            double maxValHalf = maxVal / 2;
            sum -= maxValHalf;
            maxPq.add(maxValHalf);
            minOperation++;
        }
        return minOperation;
    }
}

Was this solution helpful?