[Python3] 2 line solution || sort + greedy || 822ms / 43.50mb || beats 100%
python3 []\nclass Solution:\n    def maximumHappinessSum(self, happiness: List[int], k: int) -> int:\n        happiness.sort(reverse = True)\n        return sum
```python3 []\nclass Solution:\n    def maximumHappinessSum(self, happiness: List[int], k: int) -> int:\n        happiness.sort(reverse = True)\n        return sum(max(h-i, 0) for i, h in enumerate(happiness[:k]))\n```\n\n##### For me this problem is similar to [274. H-Index](https://leetcode.com/problems/h-index/description/)\n```python3 []\nclass Solution:\n    def hIndex(self, citations: List[int]) -> int:\n        return sum(n >= i for i, n in enumerate(sorted(citations, reverse=True), start=1))\n```
['Sorting', 'Python', 'Python3']