Submission #3599136

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define inf 1000000000
#define INF 1000000000000000
#define ll long long
#define ull unsigned long long
#define M 1000000007
#define P pair<int,int>
#define PLL pair<ll,ll>
#define FOR(i,m,n) for(int i=(int)m;i<(int)n;i++)
#define RFOR(i,m,n) for(int i=(int)m;i>=(int)n;i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n,0)
#define all(a) a.begin(),a.end()
#define IN(a,n) rep(i,n){ cin>>a[i]; }
const int vx[4] = {0,1,0,-1};
const int vy[4] = {1,0,-1,0};
#define PI 3.14159265
#define F first
#define S second
#define PB push_back
#define int ll

int a[1000000],b[1000000];

signed main(){
  int n;
  cin>>n;
  rep(i,n){
    cin>>a[i];
  }

  sort(a,a+n);


  rep(i,n/2){
    if(i%2==0){
      b[i] = a[n/2-i-1];
      b[n-i-1] = a[n/2+i];
    }
    else{
      b[i] = a[n/2+i];
      b[n-i-1] = a[n/2-i-1];
    }
  }


  int s=0;
  rep(i,n){
    cout<<b[i]<<endl;
    if(i==0) continue;
    s+=abs(b[i]-b[i-1]);
  }

  cout<<s<<endl;
}

Submission Info

Judge Result