랜선자르기(결정알고리즘)

import sys

sys.stdin = open("input.txt","rt")

x,y = map(int,input().split())
lines = []


for i in range(x):

    nums = int(input())
    lines.append(nums)


def Count(len):

    cnt = 0

    for x in lines:
        cnt += (x//len)

    return cnt


lt = 1
largest = 0
res = 0

for k in lines:

    largest = max(largest, k)

rt = largest

while lt <= rt:
    mid = (lt+rt)//2

    if Count(mid) >= y:
        res = mid
        lt = mid + 1

    else:
        rt = mid - 1

print(res)