归并题解

#include<iostream>
using namespace std;
int n,m,a[10000],b[10000],s[20000],i,j,k;
int main(){
    cin>>n>>m;
    for(int i=0;i<n;i++)cin>>a[i];
    for(int j=0;j<m;j++)cin>>b[j];
    i=j=k=0;
    while(i<n&&j<m){
        if(a[i]>b[j])s[k++]=b[j++];
        else s[k++]=a[i++];
    }
    while(i<n)s[k++]=a[i++];
    while(j<m)s[k++]=b[j++];
    for(int k=0;k<n+m;k++)cout<<s[k]<<" ";
    return 0;
}