归并排序模板

#include <map>

#include <set>

#include <stack>

#include <cmath>

#include <queue>

#include <bitset>

#include <string>

#include <vector>

#include <cstdio>

#include <cctype>

#include <fstream>

#include <cstdlib>

#include <sstream>

#include <cstring>

#include <iostream>

#include <algorithm>

#pragma comment(linker, "/STACK:1024000000,1024000000")

using namespace std;

#define   maxn          1010

#define   lson          l,m,rt<<1

#define   rson          m+1,r,rt<<1|1

#define   ms(x,y)      memset(x,y,sizeof(x))

#define   rep(i,n)      for(int i=0;i<(n);i++)

#define   repf(i,a,b)   for(int i=(a);i<=(b);i++)

#define   pii           pair<int,int>

//#define   mp            make_pair

#define   FI            first

#define   SE            second

#define   IT            iterator

#define   PB            push_back

#define   Times         10

typedef   long long     ll;

typedef   unsigned long long ull;

typedef   long double   ld;

typedef   pair<int ,int > P;

const double eps = 1e-10;

const double  pi = acos(-1.0);

const  ll    mod = 1e9+7;

const  int   inf = 0x3f3f3f3f;

const  ll    INF = (ll)1e18+300;

const int   maxd = 1010 + 10;

int ac[maxd];

int n;

void solve(int l, int r) {

    if(l >= r) {

        return ;

    }

    int L[maxd];

    int R[maxd];

    int mid = (l + r) >> 1;

    int len1 = mid - l + 1;

    int len2 = r - mid;

    for (int i = 0; i < len1; i++) {

        L[i] = ac[l + i];

    }

    int cnt = 1;

    for (int i = 0; i < len2; i++) {

        R[i] = ac[mid + i + 1];

    }

    L[len1] = inf;

    R[len2] = inf;

    int l_ = 0;

    int r_ = 0;

    for (int i = l; i <= r; i++) {

        if(L[l_] <= R[r_]){

            ac[i] = L[l_++];

        }

        else ac[i] = R[r_ ++];

    }

    solve(l, mid);

    solve(mid + 1, r);

}

int main() {

    int n;

    cin >> n;

    for (int i = 0; i < n; i++) {

        cin >> ac[i];

    }

    solve(0, n-1);

    for (int j = 0; j < n; j++) {

        cout << ac[j] << endl;

    }

}