#include<bits/stdc++.h>
using namespace std;
int main(){
priority_queue<int> q;
int t;
cin>>t;
while(t--){
long long int n;
cin>>n;
long long int arr[n];
for(long long int i=0;i<n;i++) cin>>arr[i];
priority_queue< long long int, vector<long long int> ,greater<long long int> > q;
long long int ans=0;
for(long long int i=0;i<n;i++){
q.push(arr[i]);
if(q.size()>2){
long long int x = q.top(); q.pop();
long long int y = q.top(); q.pop();
ans+=(x+y);
q.push(x+y);
}
}
long long int a= q.top(); q.pop();
long long int b= q.top(); q.pop();
ans+=(a+b);
cout<<ans<<"\n";
}
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmludCBtYWluKCl7Cglwcmlvcml0eV9xdWV1ZTxpbnQ+IHE7CglpbnQgdDsKCWNpbj4+dDsKCXdoaWxlKHQtLSl7CgkJbG9uZyBsb25nIGludCBuOwoJCWNpbj4+bjsKCQlsb25nIGxvbmcgaW50IGFycltuXTsKCQlmb3IobG9uZyBsb25nIGludCBpPTA7aTxuO2krKykgY2luPj5hcnJbaV07CgkJcHJpb3JpdHlfcXVldWU8IGxvbmcgbG9uZyBpbnQsIHZlY3Rvcjxsb25nIGxvbmcgaW50PiAsZ3JlYXRlcjxsb25nIGxvbmcgaW50PiA+IHE7CgkJbG9uZyBsb25nIGludCBhbnM9MDsKCQlmb3IobG9uZyBsb25nIGludCBpPTA7aTxuO2krKyl7CgkJCXEucHVzaChhcnJbaV0pOwoJCQlpZihxLnNpemUoKT4yKXsKCQkJCWxvbmcgbG9uZyBpbnQgeCA9IHEudG9wKCk7IHEucG9wKCk7CgkJCQlsb25nIGxvbmcgaW50IHkgPSBxLnRvcCgpOyBxLnBvcCgpOwoJCQkJYW5zKz0oeCt5KTsKCQkJCXEucHVzaCh4K3kpOwoJCQl9CgkJfQoJCWxvbmcgbG9uZyBpbnQgYT0gcS50b3AoKTsgcS5wb3AoKTsKCQlsb25nIGxvbmcgaW50IGI9IHEudG9wKCk7IHEucG9wKCk7CgkJYW5zKz0oYStiKTsKCQljb3V0PDxhbnM8PCJcbiI7Cgl9Cn0JCQ==