Submission #3666037


Source Code Expand

#include <bits/stdc++.h>
#define FOR(i, a, b) for(int i=(a); i<(b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using namespace std;

int main(){
  int n; cin >> n;
  ll x[n]; REP(i, n) cin >> x[i];

  sort(x, x+n);

  ll ans = 0, w = -n + 1;
  REP(i, n){
    ans += w * x[i];
    w += 2;
  }

  cout << ans << endl;

  return 0;
}

Submission Info

Submission Time
Task C - Pair Distance
User kobajin
Language C++14 (GCC 5.4.1)
Score 300
Code Size 407 Byte
Status AC
Exec Time 45 ms
Memory 1024 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 2
AC × 27
Set Name Test Cases
Sample s1.txt, s2.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, s1.txt, s2.txt
Case Name Status Exec Time Memory
01.txt AC 1 ms 256 KB
02.txt AC 2 ms 256 KB
03.txt AC 3 ms 256 KB
04.txt AC 2 ms 256 KB
05.txt AC 1 ms 256 KB
06.txt AC 3 ms 256 KB
07.txt AC 3 ms 256 KB
08.txt AC 3 ms 256 KB
09.txt AC 3 ms 256 KB
10.txt AC 3 ms 256 KB
11.txt AC 42 ms 896 KB
12.txt AC 45 ms 1024 KB
13.txt AC 43 ms 1024 KB
14.txt AC 41 ms 896 KB
15.txt AC 42 ms 1024 KB
16.txt AC 43 ms 1024 KB
17.txt AC 45 ms 1024 KB
18.txt AC 42 ms 1024 KB
19.txt AC 44 ms 1024 KB
20.txt AC 43 ms 1024 KB
21.txt AC 43 ms 1024 KB
22.txt AC 44 ms 1024 KB
23.txt AC 45 ms 1024 KB
24.txt AC 45 ms 1024 KB
25.txt AC 43 ms 1024 KB
s1.txt AC 1 ms 256 KB
s2.txt AC 1 ms 256 KB