Submission #74771455

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define yes cout<<"Yes"<<endl
#define no cout<<"No"<<endl
#define minsort(x) sort(x.begin(),x.end())
#define maxsort(x) sort(x.begin(),x.end(),[] (auto a,auto b) ->bool {return a>b;})
#define forn(i,x) for(auto i=0;i<x;i++)
#define norf(i,x) for(auto i=x-1;i>=0;i--)
#define fore(x) for(auto &v:x)
#define pb push_back
#define lb(_name,_element) lower_bound(_name.begin(),_name.end(),_element)
#define ub(_name,_element) upper_bound(_name.begin(),_name.end(),_element)
#define IN_MAX 0x7fffffff
#define IN_MIN 0x80000001
#define LL_MAX 0x7fffffffffffffff
#define LL_MIN 0x8000000000000001
/*
    AC 喜欢！
    WA 不喜欢！
    TLE 不喜欢！
    MLE 不喜欢！
    RTE 不喜欢！
*/
#define int long long
void solve()
{
    int n;
    cin>>n;
    vector<int>num(n);
    for(int i = 0;i<n;i++) cin>>num[i];
    //for(auto v:num) cout<<v<<" ";
    //cout<<endl;
    minsort(num);
    vector<int>pre(n);
    int total = 0;
    inclusive_scan(num.begin(),num.end(),pre.begin());
    for(int i = 0;i<n;i++)
    {
        //前面一共有i个 //后面一共有n-1-i个
        total += i*num[i] - (i-1>=0?pre[i-1]:0);
        total += pre[n-1]-pre[i]-((n-1-i)*num[i]);
    }
    cout<<total/2<<endl;

}
signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t=1;
//    cin>>t;
    while(t--) solve();
    return 0;
}

Submission Info

Judge Result