Submission #71414651

---

Source Code Expand

#include <bits/stdc++.h>
#include <cmath>
#include <algorithm>
#include <iostream>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define COUT(num,len) cout << fixed << setprecision(len) << num;
#define ALL(x) (x).begin(), (x).end()
#define coutY cout << "Yes" << endl;
#define coutN cout << "No" << endl;
#define arrIn(arr, start, N) for (int i = (start); i < (N); ++i) cin >> arr[i];
#define arrOut(arr, start, N) for  (int i = (start); i < (N); ++i) { cout << arr[i] <<" "; } cout << endl;
#define arrCopy(arr1,arr2, start, N) for (int i = (start); i < (N); ++i) arr2[i]= arr1[i];
void yn(bool tf) { cout << (tf ? "Yes\n" : "No\n"); }
void YN(bool tf) { cout << (tf ? "YES\n" : "NO\n"); }
string ABC="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
string abc="abcdefghijklmnopqrstuvwxyz";

//cout << fixed << setprecision(20) <<

int gcd(int a, int b){ //最大公約数
  if(a%b == 0){
    return b;
  }else{
    return gcd(b, a%b);
  }
}

int lcm(int a, int b){ //最小公倍数
  return a*b / gcd(a, b);
}

int main() {
  std::cin.tie(nullptr);
  std::ios_base::sync_with_stdio(false);
  ll N;
  cin >> N;
  vector<ll> A(N);
  arrIn(A,0,N);
  sort(ALL(A));
  reverse(ALL(A));
  ll ans=0;
  for(ll i=0;i<N;i++){
    ans+=A[i]*(N-1-2*i);
  }
  cout << ans << endl;
 
  return 0;
}

Submission Info

Judge Result