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

import java.util.*;
import java.io.*;

public class Main {
    int count = 0;
    
    public static void main(String[] args) {
        Main main = new Main();
        main.solve();
    }
    
    private void solve() {
        Scanner scanner = new Scanner(System.in);
        
        int factors = scanner.nextInt();
        int[] S = new int[factors];
        
        for(int i = 0; i < factors; i++) S[i] = scanner.nextInt();
        
        count = 0;
        mergeSort(S, 0, S.length);
        print(S);
        System.out.println(count);
    }
    
    private void merge(int[] X, int Xleft, int Xmid, int Xright) {
        int index_1      = Xmid - Xleft;
        int index_2      = Xright - Xmid;
        int[] leftArray  = new int[index_1 + 1];
        int[] rightArray = new int[index_2 + 1];
        
        for(int k = 0; k < index_1; k++) {
            leftArray[k] = X[Xleft + k];
        }
        
        for(int k = 0; k < index_2; k++) {
            rightArray[k] = X[Xmid + k];
        }
        
        leftArray[index_1]  = Integer.MAX_VALUE;
        rightArray[index_2] = Integer.MAX_VALUE;
        
        int i =0, j = 0;
        for(int k = Xleft; k < Xright; k++) {
            count++;
            if(leftArray[i] <= rightArray[j]) {
                X[k] = leftArray[i++];
            } else {
                X[k] = rightArray[j++];
            }
        }
    }
    
    private void mergeSort(int[] X, int Xleft, int Xright) {
        if(Xleft + 1 < Xright) {
            int Xmid = (Xleft + Xright) / 2;
            mergeSort(X, Xleft, Xmid);
            mergeSort(X, Xmid , Xright);
            
            merge(X, Xleft, Xmid, Xright);
        } 
    }
    
    private void print(Object[] xArray) {
        StringBuilder answer = new StringBuilder();
        for(Object x : xArray) answer.append(x.toString()).append(' ');
        System.out.println(answer.toString().trim());
    }
    
    private void print(int[] xArray) {
        StringBuilder answer = new StringBuilder();
        for(int x : xArray) answer.append(x).append(' ');
        System.out.println(answer.toString().trim());
    }
    
    private static class Scanner {
        BufferedReader br;
        StreamTokenizer tokenizer;
        
        public Scanner(InputStream ins) {
            br = new BufferedReader(new InputStreamReader(ins));
            tokenizer = new StreamTokenizer(br);
        }
        
        public String next() {
            nextToken();
            return tokenizer.sval;
        }
        
        public Integer nextInt() {
            nextToken();
            return (int) tokenizer.nval;
        }
        
        private int nextToken() {
            int token = tokenizer.TT_EOF;
            
            try {
                token = tokenizer.nextToken();
            } catch(IOException e) {
                ;
            }
            return token;
        }
    }
}