You are given an array transactions where transactions[i] = [cost_i, cashback_i].

The array represents a series of transactions that must be completed:

• You must possess at least cost_i money before performing the transaction.

• After paying cost_i, you receive cashback_i.

Return the minimum initial amount of money required so that all transactions can be completed regardless of the order in which they are processed.

Constraints:

• $1 \leq$ transactions.length $\leq 10^5$

• transactions[i].length $= 2$

• $0 \leq$ cost_i, cashback_i $\leq 10^9$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.