Binary example segments

n, k = map(int, input().split())
L = []
for i in range(n):
    L.append(int(input()))

if sum(L) < k:
    print(0)
else:
    left = 1
    right = max(L) + 1

    while right - left > 1:
        mid = (left + right) // 2
        t = 0
        for x in L:
            t += x // mid
        if t < k:
            right = mid
        else:
            left = mid
    print(left)