<doocs>0462.Minimum Moves to Equal Array Elements II_1.py
def minMoves2( nums: List[int]) -> int:
    nums.sort()
    k = nums[len(nums) >> 1]
    return sum(abs(v - k) for v in nums)
def sample_funcname ( var_0 : List [ int ] ) -> int :
    var_0.sort ( )
    var_6 = var_0 [ len ( var_0 ) >> 1 ]
    return sum ( abs ( var_9 - var_6 ) for var_9 in var_0 )
