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)

using System;
using System.Linq;
using System.Text;

namespace ALDS1_5_B {
    public class Problem {
        private int[] _A;
        private int _n, _count;

        public Problem(int[] A,int n) {
            _A = A;
            _n = n;
        }

        public int Count {
            get { return _count; }
        }

        public void Run() {
            _count = 0;
            MergeSort(0, _n);

            StringBuilder sb = new StringBuilder();
            sb.Append(_A[0]);
            foreach (int a in _A.Skip(1)) {
                sb.AppendFormat(" {0}", a);
            }
            sb.AppendFormat("\n{0}\n", _count);
            Console.Write(sb);
        }

        private 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);
            }
        }

        private void Merge(int left,int mid,int right) {
            int n1 = mid - left;
            int n2 = right - mid;

            int[] L = new int[n1 + 1];
            for(int i = 0; i < n1; i++) {
                L[i] = _A[left + i];
            }
            L[n1] = int.MaxValue;

            int[] R = new int[n2 + 1];
            for(int i = 0; i < n2; i++) {
                R[i] = _A[mid + i];
            }
            R[n2] = int.MaxValue;

            int x = 0;
            int y = 0;
            for (int i = left; i < right; i++) {
                if (L[x] <= R[y]) {
                    _A[i] = L[x];
                    x++;
                }
                else {
                    _A[i] = R[y];
                    y++;
                }
                _count++;
            }
        }
    }

    class Program {
        static void Main(string[] args) {
            int n = int.Parse(Console.ReadLine());
            int[] S = Console.ReadLine().Split(' ').Select(int.Parse).ToArray();

            Problem p = new Problem(S, n);
            p.Run();
        }
    }
}