题解 | #甄总搬石头#

思路

合并果子啊，每次找最小的两个数合并并加上答案，用一个优先队列即可。

代码

//#pragma GCC optimize("Ofast", "inline", "-ffast-math")
//#pragma GCC target("avx,sse2,sse3,sse4,mmx")
#include<bits/stdc++.h>
#define inf 0x3f3f3f3f
#define int long long
using namespace std;
const int N=2e5+7;
const int mod=1e9+7;

//int read(){	int x=0,f=1;char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-') f=f*-1;ch=getchar();}while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}return x*f;}

int n,v,ans;
priority_queue<int,vector<int>,greater<int> >q;

signed main(){
//	ios::sync_with_stdio(0);
//	cin.tie(0);cout.tie(0);
//  freopen("in.cpp","r",stdin);
//  freopen("out.cpp","w",stdout);
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>v;
		q.push(v);
	}
	while(q.size()>1){
		int x=q.top();q.pop();
		int y=q.top();q.pop();
		ans+=x+y;
		q.push(x+y);
	}
	cout<<ans<<"\n";
	return 0;
}