You are given an array tasks where tasks[i] = [actual$_i$, minimum$_i$]:

• actual$_i$ is the actual amount of energy consumed to finish the $i^{ ext{th}}$ task.

• minimum$_i$ is the minimum amount of energy required to begin the $i^{ ext{th}}$ task.

For example, if a task is $[$ $1$, $5$ $]$, you need at least $5$ energy to start it, and after finishing it, your energy decreases by $1$.

You can finish the tasks in any order. Return the minimum initial amount of energy needed to finish all the tasks.

Constraints:

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

• $1 \leq$ actual$_i \leq$ minimum$_i \leq 10^4$

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.