贪心&合并果子

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
#include<set>
#include<cmath>
#include<ctype.h>
using namespace std;
typedef long long LL;
//typedef pair<int ,int> P;
//const int  maxn=100000;
int ans[1005];
LL sum=0;
void solve(int x)
{
sum=0;
while(x>1)
{
int minn1=0,minn2=1;
if(ans[minn1]>ans[minn2]) swap(minn1,minn2);
for(int i=2; i<x; i++)
{
if(ans[i]<ans[minn1])
{
minn2=minn1;
minn1=i;
}
else if(ans[i]<ans[minn2]) minn2=i;
}
sum+=ans[minn1]+ans[minn2];
if(minn1==x-1) swap(minn1,minn2);
ans[minn1]=ans[minn1]+ans[minn2];
ans[minn2]=ans[x-1];
x--;
}
}
int main()
{
int T;
scanf("%d",&T);
while(T--)
{
int n;
scanf("%d",&n);
for(int i=0; i<n; i++)
scanf("%d",&ans[i]);
solve(n);
printf("%lld\n",sum);

}
return 0;
}