You are given two $0$ indexed integer arrays jobs and workers of equal length n, where jobs[i] represents the amount of work required to complete the $i^{ ext{th}}$ job, and workers[j] represents the daily work capacity of the $j^{ ext{th}}$ worker.

Each worker is assigned to exactly one job, and each job is assigned to exactly one worker. The time required for a worker with capacity workers[j] to finish a job with work jobs[i] is $\lceil$ jobs[i] $/$ workers[j] $\rceil$ days. All workers work simultaneously on their assigned jobs.

Return the minimum number of days needed to complete all jobs under an optimal assignment.

Constraints:

• n == jobs.length == workers.length

• $1 \leq$ n $\leq 10^5$

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