题解 | 有序序列合并

#include <stdio.h>
int main() {
    int n, m, i, j = 0;
    scanf("%d %d", &n, &m);
    int arr3[2000] = { 0 };
    int temp = 0;
    for (i = 0; i < n; i++) {
        scanf("%d ", &arr3[i]);
    }
    for (i = n; i < n+m; i++) {
        scanf("%d ", &arr3[i]);
    }
    //冒泡排序
    for (i = 0; i < n + m - 1; i++) {
        for (j = 0; j < n + m - i - 1; j++) {
            if (arr3[j + 1] <= arr3[j]) {
                temp = arr3[j];
                arr3[j] = arr3[j + 1];
                arr3[j + 1] = temp;
            }
        }
    }
    for (i = 0; i < m + n; i++) {
        printf("%d ", arr3[i]);
    }
    return 0;
}