用顺序表实现集合的插入,删除,并,交,差的操作

#include <stdio.h>
#include <malloc.h>
#include <stdlib.h>
#define LISTINCREAMENT 10
typedef struct status
{
int *elem;
int length;
int listsize;
int incrementsize;
}SqList;

void AuB(SqList A,SqList B,SqList &C);
void AnB(SqList A,SqList B,SqList &D);
void A_B(SqList &A,SqList B);
int GetElem(SqList L,int i);
int LocateElem(SqList L,int e);
void ListDelete(SqList &A,int i);
void main()
{
SqList A,B,C,D;
int i,a,b;
printf("输入集合A的元素个数：a = ");
scanf("%d",&a);
printf("输入集合B的元素个数：b = ");
scanf("%d",&b);
A.elem = (int *)malloc(a*sizeof(int));
B.elem = (int *)malloc(b*sizeof(int));
C.elem = (int *)malloc((a>b?a:b)*sizeof(int));
D.elem = (int *)malloc((a<b?a:b)*sizeof(int));
if(!A.el