ZOJ4118 Stones in the Bucket

水题 给出n个数 只能让某个数-1 或者 让某个数-1另一个数+1 使最后n个数都相等 问最少的操作数

AC代码：

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;

ll a[100005];

int main(){
    ll t, n, k;
    ll ans, sum;
    cin>>t;
    while (t--){
        memset(a, 0, sizeof(a));
        cin>>n;
        ans = 0, sum = 0;
        for (int i = 0; i < n; i++){
            cin>>a[i];
            sum += a[i];
        }
        sum /= n;
        for (int i = 0; i < n; i++)
            if (a[i] > sum)
                ans += a[i] - sum;
        cout<<ans<<endl;
    }
    return 0;
}