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++ (judge verdict: Accepted)

#include <iostream>
#include <cstdio>
#include <string>
#include <cmath>
#include <map>
#include <complex>
#include <vector>
#include <algorithm>

#define INF (1<<30)
#define re(i, n) for(int i=0;i<(n);i++)
#define rep(i, s, n) for(int i=(s);i<(n);i++)
#define pe(x) return cout<<(x)<<endl,0
#define PI 3.1415926535897932
using namespace std;
typedef long long ll;

int n;
int *a;
int X = 0;

int merge(int s, int m, int t) {
    int n1 = m - s;
    int n2 = t - m;
    int l[n1], r[n2];
    re(i, n1) l[i] = a[s + i];
    re(i, n2) r[i] = a[m + i];
    int i = 0, j = 0;
    int k = s;
    while (i < n1 || j < n2) {
        if (i < n1) {
            if (j < n2) {
                if (l[i] > r[j])a[k++] = r[j++], X++;
                else a[k++] = l[i++], X++;
            } else a[k++] = l[i++], X++;
        } else {
            if (j < n2) a[k++] = r[j++], X++;
            else { cout << "ERROR" << endl; }
        }
    }
}

void mergesort(int s, int t) {
    if (t - s > 1) {
        int mid = (s + t) / 2;
        mergesort(s, mid);
        mergesort(mid, t);
        merge(s, mid, t);
    }

}

int main(void) {
    cin >> n;
    a = new int[n];
    re(i, n)cin >> a[i];
    mergesort(0, n);
    re(i, n) {
        if (i != 0)cout << " ";
        cout << a[i];
    }
    cout << endl;
    cout << X << endl;

}