def main():
t = int(input())
for _ in range(t):
_ = int(input())
boxes = [int(i) for i in input().split()]
mn = min(boxes)
total = 0
for x in boxes:
total += abs(x-mn)
print(total)
main()#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
for(int x=0; x<t; x++) {
int n;
cin >> n;
long long int a[n] = {}, sum = 0;
for(int i=0; i<n; i++) {
cin >> a[i];
sum += a[i];
}
sort(a, a+n);
cout << ( sum - (a[0]*n) ) << endl;
}
return 0;
}
520A - Pangram | 124A - The number of positions |
1041A - Heist | 901A - Hashing Trees |
1283A - Minutes Before the New Year | 1654D - Potion Brewing Class |
1107B - Digital root | 25A - IQ test |
785A - Anton and Polyhedrons | 1542B - Plus and Multiply |
306A - Candies | 1651C - Fault-tolerant Network |
870A - Search for Pretty Integers | 1174A - Ehab Fails to Be Thanos |
1169A - Circle Metro | 780C - Andryusha and Colored Balloons |
1153A - Serval and Bus | 1487C - Minimum Ties |
1136A - Nastya Is Reading a Book | 1353B - Two Arrays And Swaps |
1490E - Accidental Victory | 1335A - Candies and Two Sisters |
96B - Lucky Numbers (easy) | 1151B - Dima and a Bad XOR |
1435B - A New Technique | 1633A - Div 7 |
268A - Games | 1062B - Math |
1294C - Product of Three Numbers | 749A - Bachgold Problem |