题解 | 有序序列合并

C语言版：

#include <stdio.h>

int main() {
    int n, m;
    scanf("%d %d", &n, &m);
    int arrN[n], arrM[m];
    for (int i = 0; i < n; ++i) {
        scanf("%d", &arrN[i]);
    }
    for (int j = 0; j < m; ++j) {
        scanf("%d", &arrM[j]);
    }
    int i = 0, j = 0;
    while (i < n && j < m) {
        if (arrN[i] < arrM[j]) {
            printf("%d ", arrN[i++]);
        } else {
            printf("%d ", arrM[j++]);
        }
    }
    for (; i < n; ++i) {
        printf("%d ", arrN[i]);
    }
    for (; j < m; ++j) {
        printf("%d ", arrM[j]);
    }
    return 0;
}

C++ 版：

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
    int n, m, x;
    std::cin >> n >> m;
    std::vector<int> arr;
    arr.reserve(n + m);
    for (int i = 0; i < n; ++i) {
        std::cin >> x;
        arr.push_back(x);
    }
    for (int i = 0; i < m; ++i) {
        std::cin >> x;
        arr.push_back(x);
    }
    std::sort(arr.begin(), arr.end());
    for (int x : arr) {
        std::cout << x << " ";
    }
    return 0;
}