
[LeetCode] 2594. Minimum Time to Repair Cars (Python)
·
알고리즘/LeetCode
난이도: MediumProblem Description You are given an integer array ranks representing the ranks of some mechanics.ranksi is the rank of the ith mechanic. A mechanic with a rank r can repair n cars in r * n2 minutes. You are also given an integer cars representing the total number of cars waiting in the garage to be repaired. Return the minimum time taken to repair all the cars. Note: All the mechani..