You are given two $0$ indexed integer arrays tasks and workers, where tasks[i] represents the strength required to complete the $i^{ ext{th}}$ task, and workers[j] represents the strength of the $j^{ ext{th}}$ worker.

You are also given two integers, pills and strength. You have pills magical pills available, each capable of increasing a worker’s strength by strength. Each worker may receive at most $1$ magical pill.

Each worker can be assigned to at most $1$ task, and a worker can complete a task only if their strength (with or without a pill) is greater than or equal to the task’s required strength.

Return the maximum number of tasks that can be completed.

Constraints:

• n == tasks.length

• m == workers.length

• $1 \leq$ n, m $\leq 5 imes 10^4$

• $0 \leq$ pills $\leq$ m

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