Submission #3666284

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <cstring>
#include <cctype>
#include <cmath>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <list>
#include <stdio.h>
#include <string.h>
#include <cstdlib>
#include <math.h>
#include <bitset>
#include <iterator>	
#include <iomanip>
#include <sstream>
#include <numeric>
#include <cassert>
#define INF 2000000000
#define MOD 1000000007
#define sym cout<<"---------"<<endl;
#define ll long long
#define mk make_pair
#define en endl
#define RE return 0
#define int ll
#define P pair<int,int>
using namespace std;
int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
int gcd(int a,int b){if(a%b==0){return b;}else return gcd(b,a%b);}
int lcm(int a,int b){if(a==0){return b;} return a/gcd(a,b)*b;}

#define MAX 100005

int a[MAX];
int sum[MAX];

signed main(){
	int n; cin>>n;
	for(int i=0; i<n; i++){
		cin>>a[i];
	}
	sort(a, a+n);
	int fir=a[0];
	for(int i=0; i<n; i++){
		a[i]-=fir;
	}
	int ans=0;
	for(int i=1; i<=n; i++){
		ans+=(a[i]-a[i-1])*(n-i)*i;
	}
	cout<<ans<<en;
}

Submission Info

Judge Result