题解 | #有序序列合并#

#include <stdio.h>

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