You are given an integer array ranks representing the ranks of mechanics, where ranks[i] is the rank of the $i^{ ext{th}}$ mechanic. A mechanic with rank $r$ can repair $n$ cars in $r \cdot n^2$ minutes.

You are also given an integer cars representing the total number of cars that must be repaired.

All mechanics can repair cars simultaneously.

Return the minimum time required to repair all the cars.

Constraints:

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

• $1 \leq$ ranks[i] $\leq 100$

• $1 \leq$ cars $\leq 10^6$

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.