对一组无序的整数用归并法进行排序输入第一行为数列的总个数n≤100000第二行为待排序的数列输出排序后的数列。每个数的场宽为7输入样例 1 810 4 6 3 8 2 5 7输出样例 1 2 3 4 5 6 7 8 10c++代码

#include <iostream>
#include <vector>
using namespace std;

// 归并排序
void merge(vector<int>& nums, int left, int mid, int right) {
    int n1 = mid - left + 1;
    int n2 = right - mid;
    vector<int> leftNums(n1);
    vector<int> rightNums(n2);

    // 将左半部分复制到 leftNums 数组
    for (int i = 0; i < n1; i++) {
        leftNums[i] = nums[left + i];
    }

    // 将右半部分复制到 rightNums 数组
    for (int j = 0; j < n2; j++) {
        rightNums[j] = nums[mid + 1 + j];
    }

    int i = 0, j = 0, k = left;

    // 归并
    while (i < n1 && j < n2) {
        if (leftNums[i] <= rightNums[j]) {
            nums[k] = leftNums[i];
            i++;
        } else {
            nums[k] = rightNums[j];
            j++;
        }
        k++;
    }

    // 处理剩余的元素
    while (i < n1) {
        nums[k] = leftNums[i];
        i++;
        k++;
    }

    while (j < n2) {
        nums[k] = rightNums[j];
        j++;
        k++;
    }
}

void mergeSort(vector<int>& nums, int left, int right) {
    if (left < right) {
        int mid = left + (right - left) / 2;
        mergeSort(nums, left, mid);
        mergeSort(nums, mid + 1, right);
        merge(nums, left, mid, right);
    }
}

int main() {
    int n;
    cin >> n;

    vector<int> nums(n);
    for (int i = 0; i < n; i++) {
        cin >> nums[i];
    }

    mergeSort(nums, 0, n - 1);

    for (int i = 0; i < n; i++) {
        cout << setw(7) << nums[i];
    }
    cout << endl;

    return 0;
}
``