1 solutions

  • 0
    @ 2025-11-5 16:42:29

    C++ :

    #include<iostream>
    #include<cstdio>
    #include<cstring>
    #include<algorithm>
    #include<queue>
    using namespace std;
    int a[100010],n,ans;
    priority_queue<int> q;
    
    int main()
    {
    	cin>>n;
    	for(int i=1;i<=n;i++)
    	{
    		scanf("%d",&a[i]);
    		q.push(-a[i]);
    	}
    	for(int i=1;i<n;i++)
    	{
    		int x=-q.top(); q.pop();
    		int y=-q.top(); q.pop();
    		ans+=x+y;
    		q.push(-x-y);
    	}
    	cout<<ans;
    }
    
    • 1

    Information

    ID
    17954
    Time
    1000ms
    Memory
    128MiB
    Difficulty
    (None)
    Tags
    # Submissions
    0
    Accepted
    0
    Uploaded By