IPO Python Solution with Tests

lcpy gen -n 502   # by problem number
lcpy gen -s ipo   # by problem name

Input: k = 2, w = 0, profits = [1,2,3], capital = [0,1,1]
Output: 4
Explanation: Start with capital 0, only project 0 is affordable. Finish it -> capital 1. Now projects 1 and 2 are affordable; finish project 2 -> capital 4.

Input: k = 3, w = 0, profits = [1,2,3], capital = [0,1,2]
Output: 6

import heapq


class Solution:
    # Time: O((n + k) * log n) sorting + heap operations
    # Space: O(n) for the heap
    def find_maximized_capital(self, k: int, w: int, profits: list[int], capital: list[int]) -> int:
        # Sort projects by required capital ascending.
        projects = sorted(zip(capital, profits, strict=True))
        heap: list[int] = []  # max-heap of profits (stored negated)
        index = 0
        n = len(projects)
        current = w
        for _ in range(k):
            # Push every project now affordable into the profit heap.
            while index < n and projects[index][0] <= current:
                heapq.heappush(heap, -projects[index][1])
                index += 1
            if not heap:
                break
            current += -heapq.heappop(heap)
        return current