题解 | 有序序列合并

#include <stdio.h>
#include <string.h>
int main() 
{
   int n = 0;
   int m = 0;
   scanf ("%d %d", &n, &m);
   int arr1[n];
   int arr2[m];
   int arr3[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]);
   for (i = 0; i < n; i++)
        arr3[i] = arr1[i];
   for (i = n; i < m + n -1, j < m; i++, j++)
        arr3[i] = arr2[j];
   for (i = 0; i < m + n; i++)
   {
        for (j = 0; j < m + n - 1 - i; j++)
        {
            if (arr3[j] > arr3[j + 1])
            {
                int temp = 0;
                temp = arr3[j];
                arr3[j] = arr3[j + 1];
                arr3[j + 1] = temp;
            }
            

        }
   }
   //循环输出arr
   for (i = 0; i < m + n; i++)
   {
      printf("%d ", arr3[i]);
   }
    
    return 0;
}