Given an array A of size n i.e., A = {A_1, A_2, ... A_n}

```
you are given K. you can choose any K integers (not necessarily from the given array)
i.e, X_1, X_2, X_3 .... X_K
```

```
Now, we define a function F for each A_i, such that F_i = min(abs(A_i - X_j)) where 1<= j <=K.
find the min value of max (F1, F2, F3 ..... F_n).
for example,
for
n = 3, k = 1
A = [1,7, 12]
output is 6
for n = 6, k = 3
A = [9, 63, 22, 2, 15, 58]
output is 4
```

```
constraints:
1 <= n <= 10^5
1<= K <= n
```