Codeforces Round #790 (Div. 4)B. Equal Candies

 

#include <iostream>
#include <algorithm>
#include <cstring>
 
using namespace std;
 
const int N=1010;
 
int n,m;
int f[N];
int t;
int g[N];
 
int main()
{
	int t;
	cin>>t;
	while(t--)
	{
		cin>>n;
		for(int i=1;i<=n;i++)
		{
			cin>>g[i];
		}
		sort(g+1,g+n+1);//排序，减去最小的a[0]，和即为答案
		int k=0;
		while(g[k]==0)k++;
		int sum=0;
		for(int i=k;i<=n;i++)
		{
			sum+=g[i]-g[1];
		}
		cout<<sum<<endl;
	}
	return 0;