类解决方案{

    /*** @param 整数 $k
     * @param 整数 $w
     * @param Integer[] $利润
     * @param Integer[] $资本
     * @return 整数*/
    函数 findMaximizedCapital($k, $w, $profits, $capital) {
        $n = 计数($资本);
        $minCapitalHeap = new SplMinHeap();
        为 ($i = 0; $i insert([$capital[$i], $profits[$i]]);
        }
        $maxProfitHeap = new SplMaxHeap();
        而（$k-->0）{
            while (!$minCapitalHeap->isEmpty() && $minCapitalHeap->top()[0] insert($minCapitalHeap->extract()[1]);
            }
            if ($maxProfitHeap->isEmpty()) {
                休息;
            }
             $w  = $maxProfitHeap->extract();
        }
        返回$w；
    }
}