#include<stdio.h> #include<stdlib.h> struct link { int id; int score; struct link *next; }; void display(struct link *head) { struct link* p=head; if(head==NULL) printf("head=NULL\n"); while(p!=NULL) { printf("%d %d\n",p->id,p->score); p=p->next; } } void deletenode(struct link *head) { struct link *p1=head,*p2=NULL; if(p1!=NULL) { p2=p1; p1=p1->next; free(p2); } } /* int search(struct link *head,int ID) { int p1=head; if(head==NULL) return -1; while(p1!=NULL) { if(p1->id==ID) return score; p1=p1->next; } return -1; } */ struct link *appendnode(struct link *head,int student_id,int student_score) { struct link *p1=NULL; struct link *p2=head; p1=(struct link*)malloc(sizeof(struct link)); if(p1==NULL) exit(0); if(head==NULL) head=p1; else { while(p2->next!=NULL) p2=p2->next; p2->next=p1; } p2=p1; p2->id=student_id; p2->score=student_score; p2->next=NULL; return head; } int main(void) { int m,n,i,j,t; int ID[100],SCORE[100]; int student_id,student_score; struct link *head1=NULL,*head2=NULL,*head=NULL; scanf("%d%d",&m,&n); for(i=0;i<m;i++) { scanf("%d%d",&student_id,&student_score); ID[i]=student_id; SCORE[i]=student_score; head1=appendnode(head1, student_id,student_score); } for(j=0;j<n;j++) { scanf("%d%d",&student_id,&student_score); ID[i+j]=student_id; SCORE[i+j]=student_score; head2=appendnode(head2, student_id, student_score); } for(i=0;i<n+m-1;i++) for(j=i+1;j<m+n;j++) { if(ID[i]>ID[j]) t=ID[i],ID[i]=ID[j],ID[j]=t, t=SCORE[i],SCORE[i]=SCORE[j],SCORE[j]=t; } for(i=0;i<n+m;i++) head=appendnode(head,ID[i],SCORE[i]); display(head); deletenode(head); deletenode(head1); deletenode(head2); return 0; }
解题思路:
注意事项:
参考代码:
0.0分
0 人评分
矩形面积交 (Java代码)浏览:1278 |
拆分位数 (C语言代码)浏览:1351 |
数组输出 (C语言代码)错误???浏览:597 |
【偶数求和】 (C语言代码)浏览:670 |
C语言程序设计教程(第三版)课后习题10.3 (C语言代码)浏览:562 |
C语言程序设计教程(第三版)课后习题8.8 (C语言代码)浏览:667 |
字符串输入输出函数 (C语言代码)浏览:2565 |
DNA (C语言代码)浏览:793 |
循环入门练习6 (C语言代码)浏览:1031 |
2^k进制数 (C语言描述,蓝桥杯)浏览:1452 |