462. Minimum Moves to Equal Array Elements II

class Solution(object):
    def minMoves2(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        nums.sort()
        mid=len(nums)/2
        return sum(nums[mid+len(nums)%2:])-sum(nums[:mid])