462C - Appleman and Toastman - CodeForces Solution

 
 
#include<bits/stdc++.h>
using namespace std;
 
typedef long long int  ll;

#define pi(x) cout<<x;
#define ps(x) cout<<x<<" ";
#define pnl(x) cout<<x<<"\n";
#define for0(n) for(i=0;i<n;i++)
#define for1(n) for(i=1;i<=n;i++)
#define m(x) memset(x,0,sizeof x);
#define nl cout<<"\n";
#define mp make_pair
#define pb push_back
#define fr first
#define se second
#define Inf 1e16


int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);                                                                                             
ll test,h,i,j,xy,flag=0,n,p,u,count,d,o1=0,o2=0,s,e,l,r,x,y,m,z,max1,x1,y1,k,x2,y2,z1,z2,sum,min1;


cin>>n;
vector<ll>a(n);
sum=0;
for(i=0;i<n;i++){
 cin>>a[i];
}
sort(a.begin(),a.end());
for(i=0;i+1<n;i++){
    sum+=a[i]*(i+2);
}
sum+=a[n-1]*n;
cout<<sum<<"\n";

return 0;
}