Maximum Performance of a Team Python Solution

lcpy gen -n 1383   # by problem number
lcpy gen -s maximum_performance_of_a_team   # by problem name

Input: n = 6, speed = [2,10,3,1,5,8], efficiency = [5,4,3,9,7,2], k = 2
Output: 60

Input: n = 6, speed = [2,10,3,1,5,8], efficiency = [5,4,3,9,7,2], k = 3
Output: 68

Input: n = 6, speed = [2,10,3,1,5,8], efficiency = [5,4,3,9,7,2], k = 4
Output: 72

import heapq


class Solution:
    # Time: O(n log n)
    # Space: O(k)
    def max_performance(self, n: int, speed: list[int], efficiency: list[int], k: int) -> int:
        mod = 1_000_000_007
        engineers = sorted(zip(speed, efficiency, strict=True), key=lambda x: -x[1])
        heap: list[int] = []
        total = 0
        best = 0
        for spd, eff in engineers:
            heapq.heappush(heap, spd)
            total += spd
            if len(heap) > k:
                total -= heapq.heappop(heap)
            best = max(best, total * eff)
        return best % mod