<a target="_blank" href="https://leetcode.com/problems/maximize-happiness-of-selected-children/description/">https://leetcode.com/problems/maximize-happiness-of-selected-children/description/</a>
<pre><code class="lang-python">class Solution:
 def maximumHappinessSum(self, happiness: List[int], k: int) -&gt; int:
 happiness.sort()
 happiness.reverse()

 ans = 0
 for i, e in enumerate(happiness[:k]):
 x = min(k, i, e)
 y = (e - x)
 ans += y

 return ans
</code></pre>

[https://leetcode.com/problems/maximize-happiness-of-selected-children/description/](https://leetcode.com/problems/maximize-happiness-of-selected-children/description/)

```python
class Solution:
    def maximumHappinessSum(self, happiness: List[int], k: int) -> int:
        happiness.sort()
        happiness.reverse()

        ans = 0
        for i, e in enumerate(happiness[:k]):
            x = min(k, i, e)
            y = (e - x)
            ans += y

        return ans        
        
```

3075. Maximize Happiness of Selected Children