#include<iostream>
#include<queue>
using namespace std;
int main()
{
int n=5;
int a[5]={1,2,2,5,9};
priority_queue<int,vector<int>,greater<int> > q; //小根堆
for(int i=0;i<n;i++) q.push(a[i]);//压入小根堆
int a1,a2,ax,sum=0;
while(!q.empty())
{
a1=q.top();q.pop();
if(q.empty()) break;
else {a2=q.top();q.pop();}
//取出两个最小的元素
ax=a1+a2;sum+=ax;q.push(ax);
}
cout<<sum;
return 0;
}