462 Minimum Moves to Equal array Elements II minimum number of moves make the elements equal II

Given a non-empty integer array, find the minimum number of moves required to make all array elements equal, with each move adding 1 or minus 1 to the selected element. You can assume that the array has a maximum length of 10000.
For example:
Input:
[A]
Output:
2
Description
Only two actions are necessary (remember that each step can only add 1 or minus 1 to one of the elements):
[2,2,3] = [2,2,2]
See: https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii/description/

C++:

Class Solution {public:    int minMoves2 (vector<int>& nums) {        int res = 0, i = 0, j = nums.size ()-1;        Sort (Nums.begin (), Nums.end ());        while (I < j)        {            res + = nums[j--]-nums[i++];        }        return res;    }};

Reference: https://www.cnblogs.com/grandyang/p/6089060.html

462 Minimum Moves to Equal array Elements II minimum number of moves make the elements equal II