题解 | 有序序列合并

#include <stdio.h>

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