# 백준 2110번 공유기 설치

## Solution

• C개의 공유기를 설치했을 때 최대 인접 거리는?
→ 어떤 거리 D에 대하여 공유기 C개를 설치할 수 있는가?
import java.io.*;
import java.util.*;

public class Main {
static StringBuilder sb = new StringBuilder();

static int N, C;
static int[] A;

static void input() {
N = scan.nextInt();
C = scan.nextInt();
A = new int[N + 1];
for (int i = 1; i <= N; i++) {
A[i] = scan.nextInt();
}
}

static boolean determination(int D) {
int cnt = 1;
int prev = A[1];
for (int i = 2; i <= N; i++) {
if (A[i] - prev >= D) {
cnt++;
prev = A[i];
}
}
return cnt >= C;
}

static void pro() {
Arrays.sort(A, 1, N + 1);

int L = 1, R = 1_000_000_000, ans = 0;

while (L <= R) {
int mid = (L + R) / 2;
if (determination(mid)) {
ans = mid;
L = mid + 1;
} else {
R = mid - 1;
}
}
System.out.println(ans);
}

public static void main(String[] args) {
input();
pro();
}

StringTokenizer st;

}

public FastReader(String s) throws FileNotFoundException {
}

String next() {
while (st == null || !st.hasMoreElements()) {
try {
} catch (IOException e) {
e.printStackTrace();
}
}
return st.nextToken();
}

int nextInt() {
return Integer.parseInt(next());
}

long nextLong() {
return Long.parseLong(next());
}

double nextDouble() {
return Double.parseDouble(next());
}

String nextLine() {
String str = "";
try {
} catch (IOException e) {
e.printStackTrace();
}
return str;
}
}
}