解题思路:
注意事项:
参考代码:
#include<iostream> using namespace std; struct List { int num; int score; List *next; }; void SortLift(List *head) { List *q,*pre; List *p=head->next->next; head->next->next=NULL; while(p!=NULL){ q=p->next; pre=head; while(pre->next!=NULL&&(pre->next->num<p->num)) pre=pre->next; p->next=pre->next; pre->next=p; p=q; } } int main() { int N,M; List *p; List *a=new List; List *b=new List; a->next=NULL; b->next=NULL; cin>>N>>M; List *rear=a; for(int i=0;i<N;i++){ p=new List; cin>>p->num; cin>>p->score; p->next=rear->next; rear->next=p; rear=p; } rear->next=NULL; rear=b; for(int i=0;i<M;i++){ p=new List; cin>>p->num; cin>>p->score; p->next=rear->next; rear->next=p; rear=p; } rear->next=NULL; rear->next=a->next; //将a链接到b后 SortLift(b); p=b->next; delete b; for(int i=0;i<N+M;i++){ List *temp=p; cout<<p->num<<' '<<p->score<<endl; p=p->next; delete temp; } return 0; }
0.0分
0 人评分