将两个有序表合并为一个

#include <iostream>
using namespace std;
#define Maxsize 20
typedef struct
{
    int length;
    int data[Maxsize];
    int maxSize;
}SqList;

bool Merge(SqList A,SqList B,SqList &C)
{
    if(A.length+B.length>C.maxSize)
        return false;
    int i,j,l;
    i=j=l=0;
    while(i<A.length&&j<B.length)
    {
        if(A.data[i]<B.data[j])
        {
            C.data[l]=A.data[i];
            l++;
            i++;
        }
        else
        {
            C.data[l]=B.data[j];
            l++;
            j++;
        }
    }
    while(i<A.length)
    {
        C.data[l++]=A.data[i++];
    }
    while(j<B.length)
    {
        C.data[l++]=B.data[j++];
    }
    C.length=l;
    return true;
}

int main()
{
    SqList A;
    SqList B;
    SqList C;
    int i;
    A.length=5;
    B.length=7;
    for(i=0;i<A.length;i++)
        cin>>A.data[i];
    for(i=0;i<B.length;i++)
        cin>>B.data[i];
    C.maxSize=Maxsize;
    if(Merge(A,B,C))
    {
        for(int i=0;i<C.length;i++)
            cout<<C.data[i]<<" ";
        cout<<endl;
    }
    else
        cout<<"ERROR"<<endl;
    return 0;
}