#include <cstdio>

#include <iostream>

#include <set>

#include <map>

#include <stack>

#include <queue>

#include <cstring>

#include <string>

#include <sstream>

#include <cmath>

#include <cstdlib>

#include <algorithm>

#define sf scanf

#define pf printf

#define fp(x) freopen((x), "r", stdin)

typedef long long ll;

using namespace std;

void pri1(int arr[], int start, int end)

{

    while (start<=end) pf("%d ", arr[start++]);

    pf("\n");

}

void pri2(int **arr, int start1, int end1, int start2, int end2)

{

    for (int i=start1; i<=end1; i++) {

        for (int j=start2; j<=end2; ++j) {

            pf("%d ", arr[i][j]);

        }

        pf("\n");

    }

}

void merge(int arr[], int left, int right, int tarr[])

{

    if (left>=right) return ;

    int m = (left+right) >> ;

    merge(arr, left, m, tarr);

    merge(arr, m+, right, tarr);

    int i,j, cnt;

    i = left;

    j = m+;

    cnt = ;

    while (i<=m && j<=right) {

        if (arr[i] <= arr[j])

            tarr[cnt++] = arr[i++];

        else

            tarr[cnt++] = arr[j++];

    }

    while (i<=m) tarr[cnt++] = arr[i++];

    while (j<=right) tarr[cnt++] = arr[j++];

    for (i=; i<cnt; ++i) arr[left++] = tarr[i];

}

void mergesort(int arr[], int left, int right) //区间 [a,b]

{

    int *p = new int[right-left+]; //这样就不用频繁的申请内存了。 用来保存中间的排序结果。

    merge(arr, left, right, p);

} 

int main()

{

//    int arr[] = {1, 8, 11, 5, 9, 2, 4, 6, 77, 111};

//    int arr[] = {1, 1, 1, 1, 1, 1, 1, 1, 1, 1};

//    int arr[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};

//    int arr[] = {10, 9, 8, 7, 6, 5, 4, 3, 2, 1};

//    int arr[] = {1, 2, 1, 2, 1, 1, 1, 1, 1, 1};

//    int arr[] = {1, 2, 1, 1, 1, 1, 1, 1, 1, 1};

    mergesort(arr, , );

    pri1(arr, , );

    return ;

}