题解 | #有序序列合并#

#include <stdio.h>

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