3075-maximize-happiness-of-selected-children.py

class Solution:
    def maximumHappinessSum(self, happiness: List[int], k: int) -> int:
        happiness.sort(reverse=True)
        ans = 0
        for i in range(k):
            ans += max(0, happiness[i] - i)
        return ans