UESTC 1599 wtmsb【优先队列+排序】

 1 #include <bits/stdc++.h>
 2 using namespace std;
 3 const int N=200020;
 4 int main()
 5 {
 6     int n;
 7     cin>>n;
 8     priority_queue<int, vector<int>, greater<int> >q;
 9     for(int i=0;i<n;i++)
10     {
11         int x;
12         cin>>x;
13         q.push(x);
14     }
15     int sum,ans=0;
16     while(1)
17     {
18         int head1=q.top();
19         q.pop();
20         int head2=q.top();
21         q.pop();
22         sum=head1+head2;
23         ans=ans+sum;
24         if(q.empty())
25             break;
26         q.push(sum);
27     }
28     cout<<ans<<endl;
29     return 0;
30 }