[LeetCode Sync] Runtime - 4 ms (62.67%), Memory - 17.4 MB (15.28%)

Author: NamVr

2692-take-gifts-from-the-richest-pile/solution.py

@@ -0,0 +1,17 @@
+class Solution:
+    def pickGifts(self, gifts: List[int], k: int) -> int:
+        # py has min heap so use - minus sign to simulate max heap
+        h = [-g for g in gifts]
+        heapq.heapify(h)
+
+        for _ in range(k):
+            maxElement = -heapq.heappop(h)
+
+            heapq.heappush(h, -math.floor(math.sqrt(maxElement)))
+        
+        res = 0
+        while h:
+            # now use - to make it back positive
+            res -= heapq.heappop(h)
+        
+        return res