1588: 合并果子

#include <iostream>
#include <stdio.h>
#include <algorithm>
using namespace std;

#define max 1005
int a[max];
int main()
{
    int t,b;
    long long count;
    scanf("%d",&t);
    while(t--){
        scanf("%d",&b);
        for(int i = 0;i < b;i++)
        scanf("%d",a+i);
        count = 0;
        int c =b;

        sort(a,a+b);
        while(c>=2){

            a[b-c+1]+=a[b-c];
            count += a[b-c+1];
            //for(int i =b-c+1;i <b;i++)cout<<a[i]<<" ";cout<<endl;
//cout<<"b-c+1"<<b-c+1<<endl;
            for(int i = b-c+1;i < b;i++){
                if(a[b-c+1]<a[i]){
                    int temp =a[b-c+1];
                    for(int j =b-c+2;j <i;j++){
                        a[j-1]=a[j];
                    }
                    a[i-1]=temp;
                    break;
                }else if(a[b-c+1]>=a[b-1]){
                    int temp =a[b-c+1];
                    for(int j =b-c+2;j < b;j++){
                        a[j-1]=a[j];
                    }
                    a[b-1]=temp;
                    break;
                }
            }
            //for(int i =b-c+1;i <b;i++)cout<<a[i]<<" ";cout<<endl;
            c--;
        }
        cout<<count<<endl;
    }
    return 0;
}