Submission #3604084

---

Source Code Expand

//g++ -std=c++11 -Wall -O2 -o main.exe main.cpp
//g++ -std=c++14 -Wall -O2 -o main.exe main.cpp
 
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <functional>
#include <algorithm>
#include <complex>
#include <numeric>
#include <queue>
#include <stack>
#include <tuple>
 
using namespace std;
 
#define ll long long int
#define sortasc(v, T) sort(v.begin(), v.end(), less<T>())
#define sortdesc(v, T) sort(v.begin(), v.end(), greater<T>())
 
//------
 
int N;
vector<int> A;
 
int main(){
    cin >> N;
 
    int t;
    for(int i = 0; i < N; i++){
        cin >> t;
        A.push_back(t);
    }
 
    sortasc(A, int);
 
    vector<int> less1, more1;
    for(int i = 0; i < N; i++){
        if(i < (N + 1) / 2){
            less1.push_back(A[i]);
        }
        else{
            more1.insert(more1.begin(), A[i]);
        }
    }
 
    less1.insert(less1.begin(), less1[less1.size() - 1]);
 
    ll sum1 = 0;
    for(int i = 0; i < (N - 1); i++){
        sum1 += more1[i / 2] - less1[(i + 1) / 2];
    }
 
    sortdesc(A, int);

    vector<int> less2, more2;
    for(int i = 0; i < N; i++){
        if(i < (N + 1) / 2){
            less2.push_back(A[i]);
        }
        else{
            more2.insert(more2.begin(), A[i]);
        }
    }
 
    less2.insert(less2.end(), less2[0]);

    ll sum2 = 0;
    for(int i = 0; i < (N - 1); i++){
        sum2 += less2[(i + 1) / 2] - more2[i / 2];
    }
  
//  printf("%d, %d\n", sum1, sum2);
    cout << max(sum1, sum2) << endl;
    return 0;
}

Submission Info

Judge Result