关闭

1028. List Sorting (25)

标签: 算法pat
53人阅读 评论(0) 收藏 举报
分类:

1028. List Sorting (25)

时间限制
200 ms
内存限制
65536 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue

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 1
3 1
000007 James 85
000010 Amy 90
000001 Zoe 60
Sample Output 1
000001 Zoe 60
000007 James 85
000010 Amy 90
Sample Input 2
4 2
000007 James 85
000010 Amy 90
000001 Zoe 60
000002 James 98
Sample Output 2
000010 Amy 90
000002 James 98
000007 James 85
000001 Zoe 60
Sample Input 3
4 3
000007 James 85
000010 Amy 90
000001 Zoe 60
000002 James 90
Sample Output 3
000001 Zoe 60
000007 James 85
000002 James 90
000010 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;
}


0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:7193次
    • 积分:527
    • 等级:
    • 排名:千里之外
    • 原创:47篇
    • 转载:3篇
    • 译文:0篇
    • 评论:2条
    最新评论