#283 · #2594 · Minimum Time to Repair Cars(修车的最少时间)

You are given an integer array ranks where ranks[i] is the rank of the i-th mechanic, and an integer cars. A mechanic with rank r takes r * n^2 minutes to repair n cars. All mechanics work simultaneously. Return the minimum time to repair all cars. Constraints: 1 <= ranks.length <= 10^5, 1 <= ranks[i] <= 100, 1 <= cars <= 10^6.