Submission #3666010

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;

int MOD=1e9+7;
ll INF=1e18;

int dx[]={1, -1, 0, 0};
int dy[]={0, 0, 1, -1};

int main(){
    ll n; cin>>n;
    vector<ll> x(n), xgap(n);
    for(int i=0; i<n; i++) cin>>x[i];
    sort(x.begin(), x.end());
    for(int i=0; i<n-1; i++){
        xgap[i]=abs(x[i+1]-x[i]);
    }

    vector<ll> num(n);
    for(ll i=0; i<n-1; i++){
        num[i]=(i+1)*(n-i-1);
    }

    ll ans=0;
    for(int i=0; i<n-1; i++){
        ans+=xgap[i]*num[i];
    }
    cout << ans << endl;
}

Submission Info

Judge Result