#include<iostream>
#include<queue>
#include<algorithm> 
#define ll long long
using namespace std;
priority_queue<ll,vector<ll>,greater<ll>> q;
int main()
{
    ll N;
    cin>>N;
    ll  number;
    for(ll i=0;i<N;i++)
    {
        cin>>number;
        q.push(number);
    }
    ll add=0;
    if(N>1)
    {
       while(1)
       {
          ll compare=q.top();
          q.pop();
          compare+=q.top();
          q.pop();
          add+=compare;
          if(!q.empty()) q.push(compare);
          else break;
       }
    }
    else
    {
        add=q.top();
    }
    cout<<add<<endl;
    return 0;
}

• Re:果然 改成隆隆就a了～～～～～ (725) 877801131 2016-12-15 19:12:05