Verevki

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

def check(lengths, checked, k):
    count = 0
    for l in lengths:
        num = l // checked
        count += num
        if not num:
            break
    return count >= k


if sum(lengths) < k:
    print(0)
else:
    lengths.sort(reverse=True)
    l = 0
    r = lengths[0] + 1

    while r - l > 1:
        mid = l + (r - l) // 2
        if check(lengths, mid, k):
            l = mid
        else:
            r = mid

    print(l)