Submission #5887759

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<utility>
#include<cmath>
#include<string>
#include<cstring>
#include<map>
#include<queue>
#include<set>
#define rep(i,n) for(ll i=0;i<n;i++)
#define rep1(i,n) for(ll i=1;i<=n;i++)
#define prin(arg) cout<<arg<<"\n"
#define prin2(arg1,arg2) cout<<arg1<<" "<<arg2<<"\n"
#define fill(arg,n) memset(arg,n,sizeof(arg))
#define mp make_pair
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<int,int> pi;
typedef vector<int> vi;
typedef set<int> si;
typedef string str;
const int INF=1e+9;
const ll INFLL=1e+17;
const ll MOD=1e+9+7;
ll N;
ll x[100010];
ll y[100010];
int main(){
  cin>>N;
  rep(i,N) cin>>x[i];
  sort(x,x+N);
  rep(i,N-1){
    y[i]=x[i+1]-x[i];
  }
  ll res=0;
  rep(i,N-1){
    res+=y[i]*(i+1)*(N-(i+1));
  }
  prin(res);
  return 0;
}

Submission Info

Judge Result