顺序表实现合并操作

#include
#include
#define OK 1
#define ERROR 0
typedef int Status;
typedef int ElemType;
typedef struct LNode{
	ElemType* elem;
	int length;
	int MAXNUM; 
}SqList;
Status InitSqList(SqList& L) {  
    printf("请输入顺序表的容量：");  
    scanf("%d", &L.MAXNUM);  
    if (L.MAXNUM > 0) {  
        L.elem = new ElemType[L.MAXNUM];  
        L.length = 0;  
        return OK;  
    } else {  
        return ERROR;  
    }  
}  
void MergeSqlist(SqList &La,SqList &Lb,SqList &Lc){
	Lc.length=La.length+Lb.length;
	Lc.elem=new ElemType[La.length+Lb.length];
	int pa=0,pb=0,pc=0;
	while(pa