Leet Code Daily 2024-05-09 - Maximize Happiness of Selected Children

class Solution {
public:
    long long maximumHappinessSum(vector<int>& happiness, int k) {
        sort(happiness.begin(), happiness.end());
        long long ans = 0;
        for (int i = happiness.size() - 1, d = 0; i >= 0 && d < k; i--, d++) {
            ans += max(0, happiness[i] - d);
        }
        return ans;
    }
};