You have initial capital W and can complete at most k projects. Each project has a profit and a minimum capital required. After completing a project, your capital increases by its profit. Maximize final capital. For k=2, W=0, profits=[1,2,3], capital=[0,1,1], the answer is 4. Do project 0 (profit 1, now have 1), then project 2 (profit 3, now have 4).
Here's a two-constraint greedy problem.
You need enough capital to start, then you want maximum profit.