2208. Minimum Operations to Halve Array Sum

You are given an array nums of positive integers. In one operation, you can choose any number from nums and reduce it to exactly half the number. (Note that you may choose this reduced number in future operations.)

Return the minimum number of operations to reduce the sum of nums by at least half.

class Solution {
public:
    int halveArray(vector<int>& nums) {
        int op = 0;
        long double sum = 0;
        priority_queue<double> pq;
        for(int i = 0; i < nums.size(); i++) {
            pq.push(nums[i]);
            sum += nums[i];
        }
        long double target = sum;
        while(target * 2 > sum) {
            double tp = pq.top(); pq.pop();
            target -= tp/2;
            pq.push(tp/2);
            op++;
        }
        return op;
    }
};