A shopkeeper sells n items where the price
of the th item is price[i]. To maintain
balance, the shopkeeper wishes to adjust
the price of items such that the median of
prices is exactly k. In one move, the
shopkeeper can increase or decrease the
price of any item by 1, and the shopkeeper
can perform this move any number of
times.
Find the minimum number of moves in
which the median of prices becomes exactly.
k.
Note: The index of the median of an array
of m sorted elements, where mis odd, is
(m+1)/2. For example, [2, 5, 4, 1, 1, 1, 6]
sorted is [1, 1, 1, 2, 4, 5, 6]. Its length is 7 so
the median is at index (7 + 1)/2 = 4 using 1-
based indexing. The median is 2.