<doocs>2226.Maximum Candies Allocated to K Children_1.py
def maximumCandies( candies: List[int], k: int) -> int:
    left, right = 0, max(candies)
    while left < right:
        mid = (left + right + 1) >> 1
        cnt = sum(v // mid for v in candies)
        if cnt >= k:
            left = mid
        else:
            right = mid - 1
    return left
def sample_funcname ( var_0 : List [ int ] , var_3 : int ) -> int :
    var_5 , var_7 = 0 , max ( var_0 )
    while var_5 < var_7 :
        var_9 = ( var_5 + var_7 + 1 ) >> 1
        var_12 = sum ( var_10 // var_9 for var_10 in var_0 )
        if var_12 >= var_3 :
            var_5 = var_9
        else :
            var_7 = var_9 - 1
    return var_5
