题解 | 有序序列合并

#include <stdio.h>

int main() {
    int arr1[1000]={0};
    int arr2[1000]={0};
    
    int count =0;
    int n,m=0;
    int j=0;
    scanf("%d %d",&n,&m);
    while(count<n&&scanf("%d",&j)!=EOF)
  {
    arr1[count]=j;
    count++;
  }
   count=0;
    while(count<m&&scanf("%d",&j)!=EOF)
  {
    arr2[count]=j;
    count++;
  }
  int 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;
   }