题解 | 有序序列合并

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>

int main()
{
	int n = 0;
	int m = 0;
	scanf("%d %d", &n, &m);
	int arr1[n];
    int arr2[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 *one=arr1;
    int *two=arr2;
    while((one<arr1+n)&&(two<arr2+m))
    {
        
        if(*one>=*two)
        {
            printf("%d ",*two);
            two++;
        }
        else
        {
            printf("%d ",*one);
            one++;
        }

    }
    if(one<arr1+n)
    {
        for (; one<arr1+n; one++)
	    {
		    printf("%d ", *one);
    	}
    }
    else 
    {
        for (; two<arr2+m; two++)
	    {
		    printf("%d ", *two);
    	}
    }

	return 0;
}