#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll n,m,a,b,x,z,p,y,c,d;
cin>>p;
string S;
for(ll t=0;t<p;t++){
cin>>n;
vector<ll> vect;
int arr[n];
map<ll,ll> mp1;
ll s=0;
for(ll k=0;k<n;k++){
cin>>a;
vect.push_back(a);
s+=a;
mp1[a]++;
arr[k]=a;
}
m=vect.size();
sort(vect.begin(),vect.end());
mp1.clear();
map<ll,ll> mp;
y=0;
for(ll k=0;k<m;k++) {mp1[vect[k]]=2*k-m+1;mp[vect[k]]=y;y+=vect[k];}
vector<ll> ans;
for(ll k=0;k<n;k++){
//cout<<arr[k]<<" "<<mp1[arr[k]]<<" "<<s-arr[k]<<" "<<mp[arr[k]]<<endl;
ans.push_back(mp1[arr[k]]*arr[k]+s-arr[k]-2*mp[arr[k]]+n);
cout<<ans[k]<<" ";
}
cout<<endl;
}
}
238. Product of Array Except Self | 229. Majority Element II |
222. Count Complete Tree Nodes | 215. Kth Largest Element in an Array |
198. House Robber | 153. Find Minimum in Rotated Sorted Array |
150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |
137. Single Number II | 130. Surrounded Regions |
129. Sum Root to Leaf Numbers | 120. Triangle |
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |
75. Sort Colors | 74. Search a 2D Matrix |
71. Simplify Path | 62. Unique Paths |
50. Pow(x, n) | 43. Multiply Strings |
34. Find First and Last Position of Element in Sorted Array | 33. Search in Rotated Sorted Array |
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |
1032. Stream of Characters | 987. Vertical Order Traversal of a Binary Tree |