#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#include <vector>
#include <unordered_map>
#include <unordered_set>
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ld long double
#define all(x) (x).begin(),(x).end()
#define maxint INT32_MAX
#define minint INT32_MIN
#define maxll INT64_MAX
#define minll INT64_MIN
#define nc() (p1==p2 && (p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++)
#pragma GCC optimize(2)
void write(int x);
char *p1,*p2,buf[100000];
int read();
ll ksm(ll a,ll b,ll mod);
int js(int a,int b,int c){
    int ans1,ans;
    ans1=a+b>a*b?a+b:a*b;
    ans=ans1+c>ans1*c?ans1+c:ans1*c;
    return ans;
}

void solve(){
    ll n;
    cin>>n;
    ll sum=0;
    ll a[n+1];
    for(ll i=1;i<=n;i++){
        cin>>a[i];
        sum+=a[i];
    }
    ll pj=sum/n;
    ll ans2=0;
    // if(sum%n!=0){
    //     ans2+=sum%n;
    // }
    sort(a+1,a+n+1);
    ll mina=a[1];
    ll ans1=0;
    for(int i=1;i<=n;i++){
        ans1+=a[i]-mina;
    }
    //a[n]-=ans2;
    for(int i=n;i>=1;i--){
        if(a[i]>pj){ans2+=a[i]-pj;}
        else{break;}
    }
    //ans2-=sum%n;
    //cout<<ans1<<" "<<ans2<<endl;
    cout<<(ans1>ans2?ans2:ans1)<<endl;
}


int main() {
    int t=1;
    cin>>t;
    while(t--) solve();
    return 0;
}



void write(int x)
{
    if(x<0)
        putchar('-'),x=-x;
    if(x>9)
        write(x/10);
    putchar(x%10+'0');
    return;
}
int read()
{
    int x=0,f=1;
    char ch=nc();
    while(ch<48||ch>57)
    {
        if(ch=='-')
            f=-1;
        ch=nc();
    }
    while(ch>=48&&ch<=57)
        x=x*10+ch-48,ch=nc();
   	return x*f;
}
ll ksm(ll a,ll b,ll mod){
    ll ans=1;
    a%=mod;
    while(b>0){
        if(b&1) ans=ans*a%mod;
        a=a*a%mod;
        b>>=1;
    }
    return ans;
}