F

There arenbuckets on the ground, where thei-th bucket containsaistones. Each time one can performone of the following two operations：

 

　　　　1.Remove a stone from one of the non-empty buckets.

　　　　2.Move a stone from one of the buckets (must be non-empty) to any other bucket (can be empty).

 

What’s the minimum number of times one needs to perform the operations to make all the buckets containthe same number of stones？

 

Input

There are multiple test cases. The first line of the input contains an integerT, indicating the number oftest cases. For each test case:

The first line contains an integer n(1<=n<=1e5), indicating the number of buckets.

The second line containsnintegersa1; a2;... ; an(0<=a<=1e9), indicating the number of stones in thebuckets.

It’s guaranteed that the sum ofnof all test cases will not exceed106.

 

Output

For each test case output one line containing one integer, indicating the minimum number of times neededto make all the buckets contain the same number of stones.

Sample Input

4
3
1 1 0
4
2 2 2 2
3
0 1 4
1
1000000000

Sample Output

2
0
3
0

Hint

For the first sample test case, one can remove all the stones in the first two buckets.

For the second sample test case, as all the buckets have already contained the same number of stones, no operation is needed.

For the third sample test case, one can move 1 stone from the 3rd bucket to the 1st bucket and then remove 2 stones from the 3rd bucket.

代码

 

#include<iostream>
using namespace std;
const int maxn=1e5+10;
int n,a[maxn];
int main(){
    int t;
    scanf("%d",&t);
    while(t--){
        long long count=0;
        long long sum=0;
        scanf("%d",&n);
        for(int i=0;i<n;i++){
            scanf("%d",&a[i]);
            sum+=a[i];
        }
        long long ave=sum/n;
        for(int i=0;i<n;i++){
            if(a[i]<ave) count+=(ave-a[i]);
        }
        count+=(sum-ave*n);
        printf("%lld
",count);    
    } 
}