View difference between Paste ID: pVf1jKm2 and dPbDwz5k

 import java.util.Scanner;
 
 public class Oprst {
 
     public static void main(String[] args) {
         Scanner in = new Scanner(System.in);
-        int n = in.nextInt();
+        int n = in.nextInt(), k = in.nextInt();
-        int k = in.nextInt();
+        int[] a = new int[n], b = new int[k];
-        int[] a = new int[n];
+        for (int i = 0; i < n; i++) {
-        int[] b = new int[k];
+
-        int left;
+
-        int right;
+        for (int i = 0; i < k; i++) {
-        int middle;
+
-        for (int i = 0; i < a.length; i++) {
+            int left = 0, right = n - 1, middle;
             while (left <= right) {
                 middle = (right + left) / 2;
-        for (int i = 0; i < b.length; i++) {
+                if (a[middle] <= b[i])
                     left = middle + 1;
                 else
-        for (int j = 0; j < b.length; j++) {
+                    right = middle - 1;
             }
             if (right < 0)
-            left = 0;
+                right = left;
-            right = n - 1;
+            if (left >= n)
                 left = right;
-                middle = (right - left) / 2;
+            if (Math.abs(b[i] - a[left]) < Math.abs(a[right] - b[i]))
-                if (a[middle] < b[j])
+
-                    left = middle;
+
-                if (a[middle] > b[j])
+
-                    right = middle;
+
         }
-            if (b[j] - a[left] <= a[right] - b[j])
+
     }
 
 }