题解 | #有序序列合并#

#include<stdio.h>
int main()
{
    int arr1[1000] = { 0 };
    int arr2[1000] = { 0 };
    int n = 0;
    int m = 0;
    scanf("%d", &n);
    scanf("%d", &m);
    int i = 0;
    for (i = 0;i < n;i++)
    {
        scanf("%d", &arr1[i]);
    }
    for (i = 0;i < m;i++)
    {
        scanf("%d", &arr2[i]);
    }
    int a = 0;
    int b = 0;
    while (a < n && b < m)
    {
        if (arr1[a] > arr2[b])
        {
            printf("%d ", arr2[b]);
            b++;
        }
        else
        {
            printf("%d ", arr1[a]);
            a++;
        }
    }
    if (a < n)
    {
        for (;a < n;a++)
        {
            printf("%d ", arr1[a]);
        }
    }
    if (b < m)
    {
        for (;b < m;b++)
        {
            printf("%d ", arr2[b]);
        }
    }
    return 0;
}