[백준알고리즘, PS][PYTHON] 2110번 공유기 설치

출처 : https://www.acmicpc.net/problem/2110

 

 

n , c = list(map(int,input().split(' ')))

array = []
for _ in range(n):
    array.append(int(input()))
array = sorted(array)

start = array[1] - array[0]
end = array[-1] - array[0]

while(end - start >= 0):
    mid = (start + end) //2
    router = array[0]
    count =1
    for i in range(1,len(array)):
        if (array[i] >= router + mid):
            router = array[i]
            count +=1
    if (count >= c):
        start  = mid +1
        result = mid
    else:
        end = mid -1
print(result)