[백준] 1654번 : 랜선 자르기 - Python(파이썬)

https://www.acmicpc.net/problem/1654

k,n=map(int,input().split())
arr=[0]*k
for i in range(k):
    arr[i]=int(input())
arr.sort()
max=arr[k-1]
min=1
mid=0

while min<=max:
    count=0
    mid=(min+max)//2
    for i in range(k):
        count+=arr[i]//mid
    if count>=n: min=mid+1
    else: max=mid-1
print(max)