Leetcode 2594. Minimum Time to Repair Cars

Given mechanics where a mechanic of rank r needs r * n^2 minutes to fix n cars, find the minimum time T such that all mechanics working in parallel can fix at least cars total; this reduces to finding the smallest T for which sum floor(sqrt(T / r_i)) >= cars, typically solved with a binary search over time.