502. IPO

502. IPO

class Solution:
    def findMaximizedCapital(self, k: int, w: int, profits: List[int], capital: List[int]) -> int:
        n=len(profits)
        projects=sorted(zip(capital,profits))
        i=0
        heap=[]
        while k>0:
            while i