题解 | #有序序列合并#

#define _CRT_SECURE_NO_WARNINGS 67
#include <stdio.h>

int main() {
    int m = 0;
    int n = 0;
    int i = 0;
    int j = 0;
    int arr[1000] = { 0 };
    int arr2[1000] = { 0 };
    scanf("%d %d", &m, &n);
    if (m >= 1 && m <= 1000 && n >= 1 && n <= 1000)
    {
        for (i = 0; i < m; i++)
        {
            scanf("%d", &arr[i]);
        }
        for (j = 0; j < n; j++)
        {
            scanf("%d", &arr2[j]);
        }
    }
    int arr3[3000] = { 0 };
    for (i = 0; i < m; i++)
    {
        arr3[i] = arr[i];
    }
    for (j = m,i=0; j < m + n,i<n; j++,i++)
    {
        arr3[j] = arr2[i];
    }
    for (i = 0; i <m+n; i++)
    {
        for (j = 0; j <m+n-1- i; j++)
        {
            if (arr3[j] > arr3[j + 1])
            {
                int tmp = arr3[j];
                arr3[j] = arr3[j + 1];
                arr3[j + 1] = tmp;
            }
        }
    }
    for (i = 0; i < m + n; i++)
    {
        printf("%d ", arr3[i]);
    }
    return 0;
}