提出 #3483684

---

ソースコード 拡げる

#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>

using namespace std;



int main() {

  int N;
  cin >> N;

  long long A[100000];
  for(int i = 0; i < N; ++i) cin >> A[i];
  sort(A, A+N);


  // start from minimum
  int min_idx = 1;
  int max_idx = N-1;
  bool pop_max = true;
  long long poped_num_small = A[0];
  long long poped_num_large = A[0];
  long long sum1 = 0;

  /*
  cout << A[0] << endl;
  //*/

  while(min_idx <= max_idx) {
    if(min_idx == max_idx) {
      if(pop_max) {
        /*
        cout << A[max_idx] << endl;
        //*/

        sum1 += A[max_idx] - poped_num_small;
        max_idx -= 2;
      }
      else {
        /*
        cout << A[min_idx] << endl;
        //*/

        sum1 += poped_num_large - A[min_idx];
        min_idx += 2;
      }
    }
    else {
      if(pop_max) {
        /*
        cout << A[max_idx-1] << endl;
        cout << A[max_idx] << endl;
        //*/

        sum1 += A[max_idx]   - poped_num_small;
        sum1 += A[max_idx-1] - poped_num_large;

        poped_num_small = A[max_idx-1];
        poped_num_large = A[max_idx];

        max_idx -= 2;
      }
      else {
        /*
        cout << A[min_idx] << endl;
        cout << A[min_idx+1] << endl;
        //*/

        sum1 += poped_num_small - A[min_idx];
        sum1 += poped_num_large - A[min_idx+1];

        poped_num_small = A[min_idx];
        poped_num_large = A[min_idx+1];

        min_idx += 2;
      }
    }

    /*
    cout << "min idx:" << min_idx << endl;
    cout << "max idx:" << max_idx << endl;
    //*/
    pop_max = !pop_max;
  }


  // start from maximum
  min_idx = 0;
  max_idx = N-2;
  pop_max = false;
  poped_num_small = A[N-1];
  poped_num_large = A[N-1];
  long long sum2 = 0;

  /*
  cout << A[N-1] << endl;
  //*/

  while(min_idx <= max_idx) {
    if(min_idx == max_idx) {
      if(pop_max) {
        /*
        cout << A[max_idx] << endl;
        //*/

        sum2 += A[max_idx] - poped_num_small;
        max_idx -= 2;
      }
      else {
        /*
        cout << A[min_idx] << endl;
        //*/

        sum2 += poped_num_large - A[min_idx];
        min_idx += 2;
      }
    }
    else {
      if(pop_max) {
        /*
        cout << A[max_idx-1] << endl;
        cout << A[max_idx] << endl;
        //*/

        sum2 += A[max_idx]   - poped_num_small;
        sum2 += A[max_idx-1] - poped_num_large;

        poped_num_small = A[max_idx-1];
        poped_num_large = A[max_idx];

        max_idx -= 2;
      }
      else {
        /*
        cout << A[min_idx] << endl;
        cout << A[min_idx+1] << endl;
        //*/

        sum2 += poped_num_small - A[min_idx];
        sum2 += poped_num_large - A[min_idx+1];

        poped_num_small = A[min_idx];
        poped_num_large = A[min_idx+1];

        min_idx += 2;
      }
    }

    /*
    cout << "min idx:" << min_idx << endl;
    cout << "max idx:" << max_idx << endl;
    //*/
    pop_max = !pop_max;
  }


  // result
  if(sum1 > sum2) {
    cout << sum1 << endl;
  }
  else {
    cout << sum2 << endl;
  }

}

提出情報

ジャッジ結果