题解 | #有序序列合并#

#include <stdio.h>

#define N 1010

int a[N];
int b[N];
int c[N];

// 归并
void merge(int a[], int b[], int n, int m)
{
    int k = 0, i = 0, j = 0;
    while (i < n && j < m)
    {
        if (a[i] < b[j])
            c[k ++ ] = a[i], i ++ ;
        else
            c[k ++ ] = b[j], j ++ ;
    }

    while (i < n) c[k ++ ] = a[i ++ ];
    while (j < m) c[k ++ ] = b[j ++ ];

}
int main()
{
    int n, m;
    scanf("%d %d", &n, &m);

    for (int i = 0; i < n; i ++ ) scanf("%d", &a[i]);
    for (int i = 0; i < m; i ++ ) scanf("%d", &b[i]);

    merge(a, b, n, m);

    for (int i = 0; i < n + m; i ++ ) printf("%d ", c[i]);
    return 0;
}