3736. Minimum Moves to Equal Array Elements III

You are given an integer array nums.

In one move, you may increase the value of any single element nums[i] by 1.

Return the minimum total number of moves required so that all elements in nums become equal.

class Solution {
public:
    int minMoves(vector<int>& nums) {
        return *max_element(begin(nums), end(nums)) * nums.size() - accumulate(begin(nums), end(nums), 0);
    }
};