将两个数组A和B合并为一个有序的C数组

# include<iostream>
# include<cstdio>
# include<algorithm>
using namespace std;
void Sort(int a[],int b[],int c[],int n,int m)
{
    int A=0, B=0, C=0;
    while(A<n && B<m)
    {
        if(a[A] <= b[B])
            c[C++] = a[A++];
        else
            c[C++] = b[B++];
    }
    while(A<n)
        c[C++] = a[A++];
    while(B<m)
        c[C++] = b[B++];
    for(int x = 0; x < n+m; x++)
    {
        cout<<c[x]<<" ";
    }
}
int main()
{
    int a[1000];
    int b[1000];
    int c[2000];
    int n,m;
    cin>>n>>m;

    for(int i = 0; i < n; i++)
    {
        cin>>a[i];
    }
    sort(a,a+n);
    for(int j = 0; j < m; j++)
    {
        cin>>b[j];
    }
    sort(b,b+m);
    Sort(a,b,c,n,m);
    return 0;
}