online_judge_1061
2015-03-23 21:02
99 查看
#include <stdio.h> #include <stdlib.h> #include <string.h> typedef struct Stu { char name[101]; int grade; int age; }Stu; int cmp(const void *a,const void *b) { if(((Stu *)a)->grade!=((Stu *)b)->grade) return ((Stu *)a)->grade-((Stu *)b)->grade; else if(strcmp(((Stu *)a)->name,((Stu *)b)->name)!=0) return strcmp(((Stu *)a)->name,((Stu *)b)->name); else return ((Stu *)a)->age-((Stu *)b)->age; } int main() { int n,i; Stu *s; while(~scanf("%d",&n)) { s=(Stu *)malloc(n*sizeof(Stu)); for(i=0;i<n;i++) scanf("%s%d%d",s[i].name,&s[i].age,&s[i].grade); qsort(s,n,sizeof(Stu),cmp); for(i=0;i<n;i++) printf("%s %d %d\n",s[i].name,s[i].age,s[i].grade); free(s); } return 0; }
相关文章推荐
- online_judge_1112
- online_judge_1125
- online_judge_1140
- 【Tsinghua Online Judge】旅行商(TSP)-拓扑排序求大路径
- online_judge_1367
- online_judge_1503
- SSL JudgeOnline 2322——运输
- SSL JudgeOnline 1194——最佳乘车
- http://acm.pku.edu.cn/JudgeOnline/problem?id=2528 成段更新,区间统计颜色的种类(离散化处理线段)
- Timus Online Judge初级题目:1014. Product of Digits
- HUST ACM/ICPC Online Judge Problem 1010--解题报告
- http://acm.pku.edu.cn/JudgeOnline/
- http://acm.nyist.net/JudgeOnline/problem.php?pid=118&&次小生成树
- http://acm.nyist.net/JudgeOnline/problem.php?pid=459
- ONLINE_JUDGE
- http://acm.nyist.net/JudgeOnline/problem.php?pid=301&&递推求值
- LeetCode Online Judge 题目C# 练习 - Combination Sum
- hdu1114,poj1384(完全背包)另附:http://acm.nyist.net/JudgeOnline/problem.php?pid=311
- LeetCode Online Judge 题目C# 练习 - Merge k Sorted Lists
- ACM ONLINE JUDGE