✅ One Line Solution
(Disclaimer: this is not an example to follow in a real project - it is written for fun and training mostly)Code #1.1 - One LineTime complexity: O(n∗log(maxElem
(Disclaimer: this is not an example to follow in a real project - it is written for fun and training mostly)

# Code #1.1 - One Line
Time complexity: $$O(n*log(maxElem))$$. Space complexity: $$O(1)$$.
```python3
class Solution:
    def minCapability(self, a: List[int], k: int) -> int:
        return bisect_left(range(max(a)+1),1,key=lambda c,q=0:sum(q:=q==0 and v<=c for v in a)>=k)
```

# Code #1.2 - Unwrapped
```python3
class Solution:
    def minCapability(self, a: List[int], k: int) -> int:
        def check(cap, q=0):
            return sum(q:=q==0 and v<=cap for v in a) >= k

        minCap, maxCap = 0, max(a)
        result = maxCap
        while minCap <= maxCap:
            cap = minCap + (maxCap - minCap)//2
            if check(cap):
                result = cap
                maxCap = cap - 1
            else:
                minCap = cap + 1
                
        return result
```

# Code #2 - Walrus Free
Time complexity: $$O(n*log(maxElem))$$. Space complexity: $$O(1)$$.
```python3
class Solution:
    def minCapability(self, a: List[int], k: int) -> int:
        return bisect_left(range(max(a)+1),1,key=lambda c:sum(accumulate(a,lambda q,v:q==0 and v<=c,initial=0))>=k)
```

(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']