Solved leetcode 2542

Author: vaaranan-y

2542/2542.py

@@ -0,0 +1,26 @@
+class Solution:
+    def maxScore(self, nums1: List[int], nums2: List[int], k: int) -> int:
+        pairs = [(n1, n2) for n1, n2 in zip(nums1, nums2)]
+        pairs = sorted(pairs, key=lambda p: p[1], reverse=True)
+
+        minHeap = []
+        n1Sum = 0
+
+        res = 0
+
+        for n1, n2 in pairs:
+            n1Sum += n1
+            
+            if(len(minHeap) > k - 1):
+                n1Pop = heapq.heappop(minHeap)
+                n1Sum -= n1Pop
+            
+            if(len(minHeap) == k - 1):
+                res = max(res, (n1Sum) * n2)
+            
+            heapq.heappush(minHeap, n1)
+        
+        return res
+                
+
+