Given a sorted array of integers a
, find such an integer x
that the value of
abs(a[0] - x) + abs(a[1] - x) + ... + abs(a[a.length - 1] - x)
is the smallest possible (here abs
denotes the absolute value).
If there are several possible answers, output the smallest one.
For a = [2, 4, 7]
, the output should be