有序序列合并

题目链接

• 有序序列合并
• 学归并排序之前练习

题解

#include<bits/stdc++.h>
using namespace std;
int a1[1010], a2[1010], a[2020];
int main()
{
    int n, m;
    cin>>n>>m;
    for(int i=1; i<=n; i++)cin>>a1[i];
    for(int i=1; i<=m; i++)cin>>a2[i];
    
    int i=1, j=1, k=1;
    while(i<=n && j<=m){
        if(a1[i] < a2[j])
            a[k++]=a1[i++];
        else
            a[k++]=a2[j++];
    }
    while(i<=n)a[k++]=a1[i++];
    while(j<=m)a[k++]=a2[j++];
    for(int i=1; i<=n+m; i++)cout<<a[i]<<" ";
    return 0;
}