九度OJ——1107搬水果

#include <iostream>
#include <cstdio>
#include <queue>
using namespace std; 

priority_queue<int ,vector<int>,greater<int> > apple;
int N, apple1,apple2,weight = 0;

int main()
{
    while(~scanf("%d",&N)){
        if(N == 0){
            break; 
        }
        weight = 0;
        while(!apple.empty()){
            apple.pop();
        }
        for(int i = 0 ; i < N ; i++){
            cin>>apple1;
            apple.push(apple1);
        }
        while(apple.size() > 1){
            apple1 = apple.top();
            apple.pop();
            apple2 = apple.top();
            apple.pop();
            weight += apple1+apple2;
            apple.push(apple1+apple2);
        }
        cout<<weight<<endl;
    }

    return 0;
}