题解 | #有序序列合并#

#include <stdio.h>
void pu(int arr[], int n)
{
    int i = 0;
    for (i = 0;i < n - 1;i++)
    {
        int j = 0;
        for (j = 0;j < n - 1 - i;j++)
        {
            if (arr[j] > arr[j + 1])
            {
                int tmp = arr[j];
                arr[j] = arr[j + 1];
                arr[j + 1] = tmp;
            }
        }
    }
}
int main()
{
    int n = 0;
    int m = 0;
    int j = 0;
    int arr1[1000] = { 0 };
    int arr2[1000] = { 0 };
    scanf("%d %d", &n, &m);
    int i = 0;
    for (i = 0;i < n;i++)
    {
        scanf("%d", &arr1[i]);
    }
    for (i = 0;i < m;i++)
    {
        scanf("%d", &arr2[i]);
    }
    for (i = n;i < n + m;i++)
    {
        arr1[i] = arr2[j];
        j++;
    }
    pu(arr1, m + n);
    for (i = 0;i < n + m;i++)
    {
        printf("%d ", arr1[i]);
    }
    return 0;
}