289. 랜선자르기

백준

1. 이분탐색

k, n = map(int, input().split())
data = [int(input()) for _ in range(k)]

left = 0
right = max(data)

while left <= right:
    target = 0
    mid = (left + right) // 2
    for d in data:
        target += d // mid

    if target >= n:
        left = mid + 1
    else:
        right = mid - 1
        
        

print(right)