归并排序模板

#include<bits/stdc++.h>
using namespace std;
const int maxn = 10005;
int n;
int a[maxn];
void Merge(int L, int R, int mid) {
    vector<int>v;//创建额外空间
    int p1 = L;
    int p2 = mid + 1;
    while(p1 <= mid && p2 <= R) a[p1] < a[p2] ? v.push_back(a[p1++]) : v.push_back(a[p2++]);
    while(p1 <= mid) v.push_back(a[p1++]);//将剩余元素全部加到vector中
    while(p2 <= R) v.push_back(a[p2++]);
    for(int i = 0; i < v.size(); i++) {//反过来将元素输入到a中
        a[L++] = v[i];
    }
}
void Mergesort(int L, int R) {
    if(L == R) return;
    int mid = (L + R) >> 1;
    Mergesort(L, mid);
    Mergesort(mid + 1, R);
    Merge(L, R, mid);
}
int main() {
    scanf("%d", &n);
    for(int i = 1; i <= n; i++) {
        scanf("%d", &a[i]);
    }
    Mergesort(1, n);
    for(int i = 1; i <= n; i++) {
        printf("%d ", a[i]);
    }
    return 0;
}