足够简洁，链表合并排序输出

解题思路:

注意事项:

参考代码:

#include<stdio.h>

#include<stdlib.h>

typedef struct r{

int xue;

int score;

struct r *next;

} node;

node *getnode(int n);

int main()

{

int N,M;

scanf("%d %d",&N,&M);

node *x1=getnode(N);

node *x2=getnode(M);

node *x=x1;

while(x1->next){

x1=x1->next;

if(!(x1->next)){

x1->next=x2;

break;

}

}

/*for(;x;x=x->next){

printf("%d %d\n",x->xue,x->score);

}*/

for(int i=0;i<1000;i++){

for(node *p=x;p && p->next;p=p->next){

if(p->xue>p->next->xue){

int a=p->xue;

p->xue=p->next->xue;

p->next->xue=a;

a=p->score;

p->score=p->next->score;

p->next->score=a;

}

}

}

for(;x;x=x->next){

printf("%d %d\n",x->xue,x->score);

}

return 0;

}

node *getnode(int n){

node *head=NULL;

for(int i=0;i<n;i++){

node *p;

p=(node*)malloc(sizeof(node));

scanf("%d %d",&p->xue,&p->score);

    p->next=NULL;

    node *last=head;

    if(last){

    while(last->next){

    last=last->next;

}

last->next=p;

}

else head=p;

}

return head;

}