Fence Repair （PKU 3253）

#include<bits/stdc++.h>
#define maxn 100003
using namespace std;

int l[maxn];

bool solve(){
     ll ans = 0;
	 
	 priority_queue<int,vector<int>,greater<int> > que;
	 for(int i=0;i<n;i++){
	 	que.push(l[i]);
	 }
	 while(que.size()>1){
	 	int l1,l2;
	 	l1 = que.top();
	 	que.pop();
	 	l2 = que.top();
	 	que.pop();
	 	
	 	ans += l1+l2;
	 	que.push(l1+l2);
	 }
	 cout<<ans<<endl;	
}

int main(){
	int n;
	cin>>n;
	for(int i=0;i<n;i++) cin>>l[i];
	
	solve();
	return 0;
}