Fast and Easy Python solution 769 ms, beats 96%
```\nclass Solution:\n    def maximumHappinessSum(self, happiness: List[int], k: int) -> int:\n        happiness.sort(reverse=True)\n        ans = 0\n        fo
```\nclass Solution:\n    def maximumHappinessSum(self, happiness: List[int], k: int) -> int:\n        happiness.sort(reverse=True)\n        ans = 0\n        for i in range(k):\n            if happiness[i]-i > 0:\n                ans += happiness[i]-i\n        return ans
['Python', 'Python3']