✅ One Line Solution
(Disclaimer: this is not an example to follow in a real project - it is written for fun and training mostly)CodeTime complexity: O(n∗log(minRank∗k)). Space comp
(Disclaimer: this is not an example to follow in a real project - it is written for fun and training mostly)

# Code
Time complexity: $$O(n*log(minRank*k))$$. Space complexity: $$O(1)$$.
```python3
class Solution:
    def repairCars(self, a: List[int], k: int) -> int:
        return bisect_left(range(min(a)*k*k),k,key=lambda t:sum(isqrt(t//v) for v in a))
```

(Disclaimer 2: all code above is just a product of fantasy put into one line, it is not considered as 'true' oneliners - please, remind about drawbacks only if you know how to make it better)
['Array', 'Binary Search', 'Python', 'Python3']