C 数组的距离 O(nm)存在 O(nlogm)的算法

C.java

@@ -0,0 +1,28 @@
+import java.util.Scanner;
+
+public class C {
+
+    public static void main(String[] args) {
+        int[] a = new int[cin.nextInt()];
+        int[] b = new int[cin.nextInt()];
+
+        for (int i = 0; i < a.length; i++) {
+            a[i] = cin.nextInt();
+        }
+        for (int i = 0; i < b.length; i++) {
+            b[i] = cin.nextInt();
+        }
+
+        int min = Integer.MAX_VALUE;
+        for (int i = 0; i < a.length; i++)
+            for (int j = 0; j < b.length; j++) {
+                int cur = Math.abs(a[i] - b[j]);
+                if (cur < min) min = cur;
+            }
+        System.out.println(min);
+
+        cin.close();
+    }
+
+    static Scanner cin = new Scanner(System.in);
+}