You are given an integer array workers and a two dimensional integer array tasks, where tasks[i] = [requirement_i, profit_i] indicates that the $i^{ ext{th}}$ task requires an exact skill level of requirement_i and yields a profit of profit_i.

Each worker in workers has a skill level equal to workers[i] and can complete at most $1$ task whose skill requirement exactly matches workers[i].

In addition, there is $1$ extra worker who can complete any single task without any skill requirement.

Each task can be completed at most once by at most $1$ worker.

Return the maximum total profit that can be obtained from completing the tasks.

Constraints:

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

• $1 \leq$ workers[i] $\leq 10^9$

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

• tasks[i].length $= 2$

• $1 \leq$ tasks[i][0], tasks[i][1] $\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.