```cpp
#include<bits/stdc++.h>
using namespace std;
int i,s,k,n,a[10005];
int main()
{
//freopen("P1090.in", "r", stdin);
//freopen("P1090.out", "w", stdout);
cin>>n;
for(i=0;i<n;i++)
cin>>a[i];
sort(a,a+n);
s=a[0];
for(i=1;i<n;i++)
{
a[i-1]=s;
sort(a+i-1,a+n);
s=a[i-1]+a[i];
k+=s;
}
cout<<k;
return 0;
}
```
by wwhang @ 2020-09-12 14:37:43
你的算法是O（n^2 logn）的，自然超时
by lllhhh @ 2020-09-12 14:40:18
吸氧过了……
by wwhang @ 2020-09-12 14:41:23
用优先队列，建议看题解
by Jsxts_ @ 2020-09-12 14:41:27
@[wwhang](/user/161653) az
by Jsxts_ @ 2020-09-12 14:41:43
```cpp
priority_queue<ll,vector<ll>,greater<ll> >q;
```
by ljm1621 @ 2020-09-12 14:44:24
震撼，震撼
by Spasmodic @ 2020-09-12 15:03:34
震撼
by 绝顶我为峰 @ 2020-09-12 15:08:44
震撼
by CGDGAD @ 2020-09-12 15:16:03
震撼？
by wwhang @ 2020-09-12 15:22:12