优先队列+哈夫曼树
//30MS 1152KB
#include <stdio.h>
#include <string.h>
#include <queue>
#include <algorithm>
using namespace std;
const int MAX=1e5+5;
priority_queue<int,vector<int>,greater<int> >Q;//生序,默认为降序
void read(int &x)
{
int f=1;x=0;char c=getchar();
while (c>'9'||c<'0') {if (c=='-')f=-1;c=getchar();}
while (c>='0'&&c<='9') {x=x*10+c-'0';c=getchar();};
x*=f;
}
int main ()
{
int T,n,x;
read(T);
while (T--)
{
while (!Q.empty()) Q.pop();
read(n);
for (int k=1;k<=n;k++)
{
read(x);
Q.push(x);
}
long long ans=0;
while (Q.size()>1)
{
int a=Q.top();//top()
Q.pop();
int b=Q.top();
Q.pop();
Q.push(a+b);
ans+=a+b;
}
printf("%lld\n",ans);
}
return 0;
}