#include#define MAXSIZE 100 typedef struct SeqList//顺序表的存储结构 { int elem[MAXSIZE]; int length; }SqList; void MergeList_Sq(SqList LA,SqList LB,SqList &LC) { int *p1,*p2,*q; LC.length=LA.length+LB.length; p1=LA.elem; p2=LB.elem; q=LC.elem; while(p1&&p2) { if(*p1<=*p2) { *q=*p1; p1++; } else { *q=*p2; p2++; } q++; } while(p1) { *q=*p1; p1++; q++; } while(p2) { *q=*p2; p2++; q++; } } int Input(SqList &L,int n) { if(n<1||n>MAXSIZE) return 0; int i; L.length=0; for(i=0;i



