题解 | #有序序列合并#

#include <stdio.h>

int main() {
    int n = 0;
    int m = 0;
    int arr[1000];
    int brr[1000];
    int crr[1000];
    scanf("%d %d", &n, &m);
    for (int i = 0; i < n; i++) {
        scanf("%d", &arr[i]);
    }
    for (int j = 0; j < m; j++) {
        scanf("%d", &brr[j]);
    }
    for (int i = 0; i < n; i++) {
        crr[i] = arr[i];
    }
    for (int i = 0; i < m; i++) {
        crr[n + i] = brr[i];
    }
    for (int i = 0; i < n + m; i++) {
        for (int j = 0; j < n + m - 1 - i; j++) {
            if (crr[j] > crr[j + 1]) {
                int temp;
                temp = crr[j + 1];
                crr[j + 1] = crr[j];
                crr[j] = temp;
            }
        }
    }
    for (int i = 0; i < m + n; i++) {
        printf("%d ", crr[i]);
    }
    return 0;
}