Problem:
Merge Sort

Write a program of a Merge Sort algorithm implemented by the following pseudocode. You should also report the number of comparisons in the Merge function.

Merge(A, left, mid, right)
n1 = mid - left;
n2 = right - mid;
create array L[0...n1], R[0...n2]
for i = 0 to n1-1
do L[i] = A[left + i]
for i = 0 to n2-1
do R[i] = A[mid + i]
L[n1] = SENTINEL
R[n2] = SENTINEL
i = 0;
j = 0;
for k = left to right-1
if L[i] <= R[j]
then A[k] = L[i]
i = i + 1
else A[k] = R[j]
j = j + 1

Merge-Sort(A, left, right){
if left+1 < right
then mid = (left + right)/2;
call Merge-Sort(A, left, mid)
call Merge-Sort(A, mid, right)
call Merge(A, left, mid, right)

Input

In the first line n is given. In the second line, n integers are given.

Output

In the first line, print the sequence S. Two consequtive elements should be separated by a space character.

In the second line, print the number of comparisons.

Constraints

n ≤ 500000

0 ≤ an element in S ≤ 109

Sample Input 1

10
8 5 9 2 6 3 7 1 10 4

Sample Output 1

1 2 3 4 5 6 7 8 9 10
34

Notes

Solution in C++14 (judge verdict: Accepted)

#include <vector>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <algorithm>

#define REP( i, n) for( int i = 0; i < (n); ++i)
#define FOR( i, a, b) for( int i = (a); i < (b); ++i)

#define pb push_back

const int INF = 1001001000;
const int MOD = (int)1e9 + 7;

using ll = long long;

using namespace std;

vector<int> a;
int n;
int abc;

void merge( int left, int mid, int right){
  int n1 = mid - left;
  int n2 = right - mid;
  int l[n1], r[n2];
  REP( i, n1){
    l[i] = a[left+i];
  }
  REP( i, n2){
    r[i] = a[mid+i];
  }
  l[n1] = INF;
  r[n2] = INF;
  int i = 0, j = 0;
  FOR( k, left, right){
    ++abc;
    if( l[i] <= r[j]){
      a[k] = l[i];
      ++i;
    }else{
      a[k] = r[j];
      ++j;
    }
  }
}

void mergeSort( int left, int right){
  if( left+1 < right){
    int mid = (left+right)/2;
    mergeSort( left, mid);
    mergeSort( mid, right);
    merge( left, mid, right);
  }
}


int main(){
  cin >> n;
  a.resize(n);
  abc = 0;
  REP( i, n){
    cin >> a[i];
  }

  mergeSort( 0, n);

  REP( i, n-1){
    cout << a[i] << " ";
  }
  cout << a[n-1] << endl;
  cout << abc << endl;

}