diff --git "a/lkhyun/202503/17 BOJ \352\263\250\353\223\2344 \352\263\265\354\234\240\352\270\260 \354\204\244\354\271\230.md" "b/lkhyun/202503/17 BOJ \352\263\250\353\223\2344 \352\263\265\354\234\240\352\270\260 \354\204\244\354\271\230.md"
new file mode 100644
index 00000000..28cd153d
--- /dev/null
+++ "b/lkhyun/202503/17 BOJ \352\263\250\353\223\2344 \352\263\265\354\234\240\352\270\260 \354\204\244\354\271\230.md"	
@@ -0,0 +1,48 @@
+```java
+import java.util.*;
+import java.io.*;
+
+public class Main {
+	static int N;
+	static int C;
+	static int[] arr;
+	static int max;
+	public static void main(String[] args)throws Exception{
+		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+		BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
+		StringTokenizer st = new StringTokenizer(br.readLine());
+		N = Integer.parseInt(st.nextToken());
+		C = Integer.parseInt(st.nextToken());
+		arr = new int[N];
+		for(int i=0;i<N;i++) {
+			arr[i] = Integer.parseInt(br.readLine());
+		}
+		Arrays.sort(arr);
+
+		max = binarySearch(0, 1000000000);
+		bw.write(max+"");
+		bw.close();
+	}
+	public static int binarySearch(int s, int e){
+		int mid = 0;
+		while(s<e){
+			mid = (s+e)/2 + 1;
+			int cur = arr[0];
+			int cnt = 1;
+			for(int i=1;i<N;i++){
+				if(arr[i]-cur>=mid){
+					cur = arr[i];
+					cnt++;
+				}
+			}
+			if(cnt<C){
+				e = mid-1;
+			}else{
+				s = mid;
+			}
+		}
+		return s;
+	}
+}
+
+```