fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int long long int
  4. #define double long double
  5. #define print(a) for(auto x : a) cout << x << " "; cout << endl
  6.  
  7.  
  8. const int M = 1000000007;
  9. const int N = 3e5+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b, int mod=M) {
  14. int x = 1;
  15. a %= mod;
  16. while (b) {
  17. if (b & 1) x = (x * a) % mod;
  18. a = (a * a) % mod;
  19. b >>= 1;
  20. }
  21. return x;
  22. }
  23.  
  24.  
  25. //_ ***************************** START Below *******************************
  26.  
  27.  
  28.  
  29.  
  30. vector<int> a;
  31.  
  32. int consistency(int n){
  33.  
  34. sort(begin(a), end(a));
  35.  
  36. vector<int> dif(n-1);
  37. for(int i=1; i<n; i++){
  38. dif[i-1] = a[i]-a[i-1];
  39. }
  40.  
  41. n = n-1;
  42.  
  43. int ans = 0;
  44. int i=0, j=n-1;
  45. while(i<=j){
  46. ans += (i+1)*dif[i];
  47. if(i!=j) ans += (i+1)*dif[j];
  48. i++;
  49. j--;
  50. }
  51.  
  52. return ans;
  53. }
  54.  
  55.  
  56.  
  57.  
  58.  
  59.  
  60.  
  61.  
  62.  
  63.  
  64.  
  65.  
  66.  
  67.  
  68.  
  69. int practice(int n){
  70.  
  71.  
  72. return 0;
  73. }
  74.  
  75.  
  76.  
  77.  
  78.  
  79. void solve() {
  80.  
  81. int n;
  82. cin>> n;
  83.  
  84. a.resize(n);
  85. for(int i=0; i<n; i++) cin >> a[i];
  86.  
  87. cout << consistency(n) << endl;
  88.  
  89.  
  90. }
  91.  
  92.  
  93.  
  94.  
  95.  
  96. int32_t main() {
  97. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  98.  
  99. int t = 1;
  100. // cin >> t;
  101. while (t--) {
  102. solve();
  103. }
  104.  
  105. return 0;
  106. }
Success #stdin #stdout 0.01s 5224KB
stdin
5
1 4 5 100 100
stdout
195