diff --git "a/LiiNi-coder/202509/10 BOJ \354\210\230 \352\263\240\353\245\264\352\270\260.md" "b/LiiNi-coder/202509/10 BOJ \354\210\230 \352\263\240\353\245\264\352\270\260.md"
new file mode 100644
index 00000000..4718591d
--- /dev/null
+++ "b/LiiNi-coder/202509/10 BOJ \354\210\230 \352\263\240\353\245\264\352\270\260.md"	
@@ -0,0 +1,35 @@
+```java
+import java.io.BufferedReader;
+import java.io.InputStreamReader;
+import java.io.IOException;
+import java.util.StringTokenizer;
+import java.util.Arrays;
+
+public class Main {
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st = new StringTokenizer(br.readLine());
+        int N = Integer.parseInt(st.nextToken());
+        int M = Integer.parseInt(st.nextToken());
+        int[] arr = new int[N];
+        for (int i = 0; i < N; i++) {
+            arr[i] = Integer.parseInt(br.readLine());
+        }
+
+        Arrays.sort(arr);
+        int left = 0;
+        int right = 0;
+        int answer = Integer.MAX_VALUE;
+        while (right < N) {
+            int diff = arr[right] - arr[left];
+            if (left >= right || diff < M) {
+                right++;
+            } else {
+                answer = Math.min(answer, diff);
+                left++;
+            }
+        }
+        System.out.println(answer);
+    }
+}
+```