Submission #9930717

---

Source Code Expand

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.HashSet;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Main main = new Main();
        main.solve();
    }
    public void solve() {
        Scanner scan = new Scanner(new BufferedReader(new InputStreamReader(System.in)));
        int N = scan.nextInt();
        long[] x = new long[N];
        for (int i = 0; i < N; i++) {
            x[i] = scan.nextLong();
        }
        Arrays.sort(x);
        long ans = 0;
        for (int i = 1; i <= N; i++) {
            ans += x[i-1] * (i - 1) - x[i-1] * (N - i);
        }
        System.out.println(ans);
    }
}

Submission Info

Judge Result