题解 | #有序序列合并#

#include <stdio.h>

int main() {
    int arr[2000] = {0};
    int n = 0, m = 0;
    scanf("%d %d", &n, &m);
    int i = 0;
    for (i = 0; i < n; i++) {
        scanf("%d", &arr[i]);
    }
    for (int j = n; j <n + m; j++) {
        scanf("%d", &arr[j]);
    }
    int a = 0;
    for (a = 0; a < n + m; a++) {
        int b = 0;
        for (b = 0; b < n + m - a-1; b++) {
            int tmp=0;
            if (arr[b] > arr[b + 1]) {
                tmp = arr[b];
                arr[b ] = arr[b+1];
                arr[b+1] = tmp;
            }
        }
    }
    for(int q=0;q<m+n;q++){
        printf("%d ",arr[q]);
    }
    return 0;
    }