You are given n jobs and m workers, represented by three arrays: difficulty, profit, and worker.

• difficulty[i] and profit[i] represent the difficulty level and profit of the i-th job.

• worker[j] represents the maximum difficulty level the j-th worker can handle.

A worker can complete a job only if the job’s difficulty is less than or equal to that worker’s ability. Each worker can be assigned at most one job, but multiple workers can complete the same job.

If a worker cannot complete any job, they contribute $0$ profit.

Return the maximum total profit achievable by assigning jobs to workers optimally.

Constraints:

• n == difficulty.length

• n == profit.length

• m == worker.length

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

• $1 \leq$ difficulty[i], profit[i], worker[i] $\leq 10^5$

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.