K Closest :
Difficulty Level : Medium
Submissions : 1604
Asked In :
Marks :10
: 16 | : 7
Given an N-sized array of integers and value 'X', find the k closest integers with respect to 'X'.
It is guaranteed that X is present in the given array.
In case there are two values with same distance from 'X', prefer the smaller value.
Input
First line contains a single integer corresponding to integer N.
Second line contains N space separated integers corresponding to the values in the given array.
Third line contains two space separated integers corresponding to 'k' and 'X'
Constraints
$$$ 1 \le k < N \le 100000 $$$
$$$ 1 \le arr[i] , X \le 10^9 $$$
Output
Print K-closest integers in sorted order. (Ascending Order)
Example
Input
10 1 2 3 4 5 10 9 8 7 6 3 4
Output
2 3 5
