提交时间:2024-03-02 15:54:54

运行 ID: 134448

#include<bits/stdc++.h> using namespace std; int n,t,ans; priority_queue<int,vector<int>,greater<int> >q; int main() { cin>>n; for(int i=1;i<=n;i++) cin>>t,q.push(t); while(q.size()>1) { int a,b; a=q.top(); q.pop(); b=q.top(); q.pop(); q.push(a+b); ans+=a+b; } cout<<ans; }