#include<iostream>
using namespace std;typedef struct lnode
{int data;struct lnode *next;
} lnode,*LinkList;void CreateList(LinkList &L,int n)
{L=new lnode;L->next=NULL;for(int i=0; i<n; i++){lnode *p;p=new lnode;cin>>p->data;p->next=L->next;L->next=p;}
}void MegerList(LinkList &LA,LinkList &LB,LinkList &LC)
{lnode *pa,*pb,*pc;pa=new lnode;pb=new lnode;pc=new lnode;pa=LA->next;pb=LB->next;LC=LA;pc=LC;while(pa&&pb){if(pa->data<pb->data){pc->next=pa;pc=pa;pa=pa->next;}if(pa->data>pb->data){pc->next=pb;pc=pb;pb=pb->next;}if(pa->data==pb->data){pc->next=pa;pc=pa;pa=pa->next;pb=pb->next;}}pc->next=pa?pa:pb;delete LB;
}void display(LinkList &L)
{lnode *p;p=new lnode;p=L->next;while(p){cout<<p->data;p=p->next;}
}int main()
{LinkList LA,LB,LC;int m,n;cout<<"请输入LA的长度:";cin>>m;cout<<"请逆序递减输入LA的元素:";CreateList(LA,m);cout<<"请输入LB的长度:";cin>>n;cout<<"请逆序递减输入LB的元素:";CreateList(LB,n);MegerList(LA,LB,LC);cout<<"合并后的链表LC为:";display(LC);return 0;
}