1028. List Sorting (25)
来源:互联网 发布:微软软件win10下载 编辑:程序博客网 时间:2024/06/03 14:52
1028. List Sorting (25)
Excel can sort records according to any column. Now you are supposed to imitate this function.
Input
Each input file contains one test case. For each case, the first line contains two integers N (<=100000) and C, where N is the number of records and C is the column that you are supposed to sort the records with. Then N lines follow, each contains a record of a student. A student's record consists of his or her distinct ID (a 6-digit number), name (a string with no more than 8 characters without space), and grade (an integer between 0 and 100, inclusive).
Output
For each test case, output the sorting result in N lines. That is, if C = 1 then the records must be sorted in increasing order according to ID's; if C = 2 then the records must be sorted in non-decreasing order according to names; and if C = 3 then the records must be sorted in non-decreasing order according to grades. If there are several students who have the same name or grade, they must be sorted according to their ID's in increasing order.
Sample Input 13 1000007 James 85000010 Amy 90000001 Zoe 60Sample Output 1
000001 Zoe 60000007 James 85000010 Amy 90Sample Input 2
4 2000007 James 85000010 Amy 90000001 Zoe 60000002 James 98Sample Output 2
000010 Amy 90000002 James 98000007 James 85000001 Zoe 60Sample Input 3
4 3000007 James 85000010 Amy 90000001 Zoe 60000002 James 90Sample Output 3
000001 Zoe 60000007 James 85000002 James 90000010 Amy 90
#include<stdio.h>#include<stdlib.h>#include<string.h>struct info {int id;char name[10];int grade;} stu[100001];int cmp1(const void* a, const void* b){struct info aa = *((struct info*)a);struct info bb = *((struct info*)b);return aa.id > bb.id;}int cmp2(const void* a, const void* b){int ans;struct info aa = *((struct info*)a);struct info bb = *((struct info*)b);ans = strcmp(aa.name, bb.name);return ans > 0 || ans == 0 && aa.id > bb.id;}int cmp3(const void* a, const void* b){struct info aa = *((struct info*)a);struct info bb = *((struct info*)b);return aa.grade > bb.grade || aa.grade == bb.grade && aa.id > bb.id;}int main(){int n, c, i;scanf("%d %d", &n, &c);for (i = 0; i < n; i++){scanf("%d %s %d",&stu[i].id, stu[i].name, &stu[i].grade);}if (c == 1){qsort(stu, n, sizeof(struct info), cmp1);}else if (c == 2){qsort(stu, n, sizeof(struct info), cmp2);}else if (c == 3){qsort(stu, n, sizeof(struct info), cmp3);}for (i = 0; i < n; i++){printf("%06d %s %d\n", stu[i].id, stu[i].name, stu[i].grade);}return 0;}
- 1028. List Sorting (25)
- 1028. List Sorting (25)
- 1028. List Sorting (25)
- 1028. List Sorting (25)
- 1028. List Sorting (25)
- 1028. List Sorting (25)
- 1028. List Sorting (25)
- 1028. List Sorting (25)
- 1028. List Sorting (25)
- 1028. List Sorting (25)
- 1028. List Sorting (25)
- 1028. List Sorting (25)
- 1028. List Sorting (25)
- 1028. List Sorting (25)
- 1028. List Sorting (25)
- 1028. List Sorting (25)
- 1028. List Sorting (25)
- 1028. List Sorting (25)
- leetcode :Binary Search:Pow(x, n)(050)
- JS一维数组、多维数组和对象的混合使用
- eclipse 有的地方打不上断点,设置的断点有斜杠
- 表单的简单使用
- 职责链模式(java版)
- 1028. List Sorting (25)
- vue vue-socket.io 模块
- 集合框架总结(collections)
- Xcode奇淫巧技(二)——快捷键
- [Lintcode] Combination Sum II
- J2SE第三章面向对象设计思想
- 回溯法案列总结
- 浅谈Java中的深拷贝和浅拷贝
- 36个Android开发常用代码片段