A21705
2024-05-12 12:28:32
发布于:江苏
52阅读
0回复
0点赞
不是这就是A5703啊(堆)
#include<bits/stdc++.h>
using namespace std;
priority_queue<int,vector<int>,greater<int> > q;
int main(){
int n;
cin >> n;
for(int i = 1;i <= n;i++){
int x; cin >> x;
q.push(x);
}
int sum = 0;
while(q.size() > 1){
int t1 = q.top();
q.pop();
int t2 = q.top();
q.pop();
sum += (t1 + t2);
q.push(t1 + t2);
}
cout << sum << endl;
return 0;
}
//boc
//boc
这里空空如也
有帮助,赞一个