Dec 12

Author: siddydutta

2024-12-December-LeetCoding-Challenge/README.md

@@ -14,7 +14,7 @@
 | December 9  | [3152. Special Array II](https://leetcode.com/problems/special-array-ii/) | Medium | Solved |
 | December 10 | [2981. Find Longest Special Substring That Occurs Thrice I](https://leetcode.com/problems/find-longest-special-substring-that-occurs-thrice-i/) | Medium | Unsolved |
 | December 11 | [2779. Maximum Beauty of an Array After Applying Operation](https://leetcode.com/problems/maximum-beauty-of-an-array-after-applying-operation/) | Medium | Unsolved |
-| December 12 | []() |  |  |
+| December 12 | [2558. Take Gifts From the Richest Pile](https://leetcode.com/problems/take-gifts-from-the-richest-pile/) | Easy | Solved |
 | December 13 | []() |  |  |
 | December 14 | []() |  |  |
 | December 15 | []() |  |  |
@@ -38,6 +38,6 @@
 ## Summary
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
-| Easy   | 2 | 2 | 0 |
+| Easy   | 3 | 3 | 0 |
 | Medium | 9 | 6 | 3 |
 | Hard   | 0 | 0 | 0 |

2024-12-December-LeetCoding-Challenge/Take Gifts From the Richest Pile.py

@@ -0,0 +1,27 @@
+from heapq import heapify, heappop, heappush
+from math import isqrt
+from typing import List
+
+
+class Solution:
+    def pickGifts(self, gifts: List[int], k: int) -> int:
+        heap = [-gift for gift in gifts]
+        heapify(heap)
+        for _ in range(k):
+            max_pile = -heappop(heap)
+            heappush(heap, -isqrt(max_pile))
+        return -sum(heap)
+
+
+def main():
+    gifts = [25, 64, 9, 4, 100]
+    k = 4
+    assert Solution().pickGifts(gifts, k) == 29
+
+    gifts = [1, 1, 1, 1]
+    k = 4
+    assert Solution().pickGifts(gifts, k) == 4
+
+
+if __name__ == '__main__':
+    main()