Submission #10182880
Source Code Expand
//
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, P>IP;
typedef vector<ll> V;
typedef vector<V> V2;
typedef vector<vector<P> > G;
void g_dir(G &graph, ll a, ll b, ll w = 1){graph[a].push_back(P(b, w));}
void g_undir(G &graph, ll a, ll b, ll w = 1){g_dir(graph, a, b, w);g_dir(graph, b, a, w);}
#define rep(i, n) for(ll (i) = 0; (i) < (n); (i)++)
#define rep1(i, n) for(ll (i) = 1; (i) <= (n); (i)++)
#define rrep(i, n) for(ll (i) = (n) - 1; (i) >= 0; (i)--)
#define rrep1(i, n) for(ll (i) = (n); (i) >= 1; (i)--)
template<class T> void chmax(T &a, const T &b){if(a < b){a = b;}}
template<class T> void chmin(T &a, const T &b){if(a > b){a = b;}}
const ll INF = 1145141919;
const ll MOD = 1000000007;
const ll NUM = 101010;
int main(){
ll N;
cin >> N;
V v(N);
rep(i, N)cin >> v[i];
sort(v.begin(), v.end());
ll ans = 0;
for(ll i = 1; i < N; i++){
ans += ans + i * (v[i] - v[i - 1]);
}
cout << ans << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
C - Pair Distance |
User |
kagasan |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
1067 Byte |
Status |
WA |
Exec Time |
46 ms |
Memory |
1024 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
0 / 300 |
Status |
|
|
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 |
WA |
1 ms |
256 KB |
02.txt |
WA |
2 ms |
256 KB |
03.txt |
WA |
3 ms |
256 KB |
04.txt |
WA |
2 ms |
256 KB |
05.txt |
WA |
1 ms |
256 KB |
06.txt |
WA |
3 ms |
256 KB |
07.txt |
WA |
3 ms |
256 KB |
08.txt |
WA |
3 ms |
256 KB |
09.txt |
WA |
3 ms |
256 KB |
10.txt |
WA |
3 ms |
256 KB |
11.txt |
WA |
42 ms |
1024 KB |
12.txt |
WA |
45 ms |
1024 KB |
13.txt |
WA |
44 ms |
1024 KB |
14.txt |
WA |
42 ms |
1024 KB |
15.txt |
WA |
43 ms |
1024 KB |
16.txt |
WA |
43 ms |
1024 KB |
17.txt |
WA |
45 ms |
1024 KB |
18.txt |
WA |
43 ms |
1024 KB |
19.txt |
WA |
44 ms |
1024 KB |
20.txt |
WA |
44 ms |
1024 KB |
21.txt |
WA |
43 ms |
1024 KB |
22.txt |
WA |
44 ms |
1024 KB |
23.txt |
WA |
46 ms |
1024 KB |
24.txt |
WA |
45 ms |
1024 KB |
25.txt |
WA |
43 ms |
1024 KB |
s1.txt |
AC |
1 ms |
256 KB |
s2.txt |
AC |
1 ms |
256 KB |