chore: sync automated leetcode submissions with Runtime - 800 ms (83.78%), Memory - 44.4 MB (57.43%)

Author: bufferwise

3351-maximize-happiness-of-selected-children/solution.py

@@ -0,0 +1,13 @@
+class Solution:
+    def maximumHappinessSum(self, happiness: List[int], k: int) -> int:
+        happiness.sort(reverse=True)
+        
+        total_happiness = 0
+        for i in range(k):
+            current_val = happiness[i] - i
+            if current_val <= 0:
+                break
+                
+            total_happiness += current_val
+            
+        return total_happiness