462. Minimum Moves to Equal Array Elements II

1. Minimum Moves to Equal Array Elements II
   Given a non-empty integer array, find the minimum number of moves required to make all array elements equal, where a move is incrementing a selected element by 1 or decrementing a selected element by 1.

You may assume the array’s length is at most 10,000.

Example:

Input:
[1,2,3]

Output:
2

Explanation:
Only two moves are needed (remember each move increments or decrements one element):

[1,2,3] => [2,2,3] => [2,2,2]
这里要想步骤最少，取得标准参考应该是数组的中位数。
证明：
先将数组按递增的顺序排好序

$$\ y_1=\sum_{i=0}^k (a_k-a_i)-\sum_{i=k+1}^n（a_i-a_k）,k \neq\frac{n}{2}$$
$$\ y_2=\sum_{i=0}^\frac{n}{2} (a_\frac{n}{2}-a_i)-\sum_{i=\frac{n}{2}+1}^n（a_i-a_\frac{n}{2}）$$
假设 $k>\frac{n}{2}$，即 $a_k=a_\frac{n}{2}+x, x>0$，
$$y_1-y_2=\sum_{i=\frac{n}{2}+1}^k(a_k-a_i)+\frac{n}{2}\times x+\sum_{i=\frac{n}{2}+1}^k(a_i-a_\frac{n}{2})+(k-n)\times x =\sum_{i=\frac{n}{2}+1}^k(a_k-a_\frac{n}{2})+(k-\frac{n}{2})\times x=(2k-n)\times x>0$$
同理，当 $a_k<a_\frac{n}{2}$时，也比 $y_2$大。
因此，如果取得不是中位数，最后的结果都会比这大。

int minMoves2(vector<int>& nums) {
 int n=nums.size();
 sort(nums.begin(),nums.end());
 int r=0;
 for(int i:nums)
 r+=abs(i-nums[n/2]);
 return r;
}