We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 019b886 commit a6c3b63Copy full SHA for a6c3b63
2542/2542.py
@@ -0,0 +1,26 @@
1
+class Solution:
2
+ def maxScore(self, nums1: List[int], nums2: List[int], k: int) -> int:
3
+ pairs = [(n1, n2) for n1, n2 in zip(nums1, nums2)]
4
+ pairs = sorted(pairs, key=lambda p: p[1], reverse=True)
5
+
6
+ minHeap = []
7
+ n1Sum = 0
8
9
+ res = 0
10
11
+ for n1, n2 in pairs:
12
+ n1Sum += n1
13
14
+ if(len(minHeap) > k - 1):
15
+ n1Pop = heapq.heappop(minHeap)
16
+ n1Sum -= n1Pop
17
18
+ if(len(minHeap) == k - 1):
19
+ res = max(res, (n1Sum) * n2)
20
21
+ heapq.heappush(minHeap, n1)
22
23
+ return res
24
25
26
0 commit comments