# LeetCode - 0453. Minimum Moves to Equal Array Elements
### 題目網址：https://leetcode.com/problems/minimum-moves-to-equal-array-elements/
###### tags: `LeetCode` `Easy` `數學`

/*
    -LeetCode format-
    Problem: 453. Minimum Moves to Equal Array Elements
    Difficulty: Easy
    
    by Inversionpeter
*/



class Solution {
public:
    int minMoves(vector<int>& nums) {
        int minimum = 2147483647;
        long long sums = 0;
        for (int i : nums)
            sums += i, minimum = min(minimum, i);
        return sums - nums.size() * minimum;
    }
};