浙大 PAT Advanced level 1028. List Sorting (25)
来源:互联网 发布:mac pro 充电器价格 编辑:程序博客网 时间:2024/05/16 05:19
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
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 <iostream>#include <string.h>#include <algorithm>#include <stdio.h>using namespace std;typedef struct node{unsigned int ID;char name[9];unsigned int grade;}node;node records[100005];bool compare_column1(node &A, node &B){return A.ID < B.ID;}bool compare_column2(node &A, node &B){int ret = strcmp(A.name, B.name);if (0 == ret){return compare_column1(A, B);}else{if (ret < 0){return true;}else{return false;}}}bool compare_column3(node &A, node &B){if (A.grade == B.grade){return compare_column1(A, B);}return A.grade < B.grade;}int main(){int num;int column;cin >> num >> column;for (int i = 0; i != num; ++i){cin >> records[i].ID;cin >> records[i].name;cin >> records[i].grade;}switch (column){case 1:sort(records, records+num, compare_column1);break;case 2:sort(records, records+num, compare_column2);break;case 3:sort(records, records+num, compare_column3);break;}for (int i = 0; i != num; ++i){printf("%06d ", records[i].ID);printf("%s ", records[i].name);printf("%d\n", records[i].grade);}system("pause");return 0;}
0 0
- 浙大 PAT Advanced level 1028. List Sorting (25)
- 【PAT】【Advanced Level】1028. List Sorting (25)
- 1028. List Sorting (25) @ PAT (Advanced Level) Practise
- 【C++】PAT(advanced level)1028. List Sorting (25)
- PAT (Advanced Level) 1028. List Sorting (25) 结构体排序
- PAT (Advanced Level) Practise 1028 List Sorting (25)
- PAT (Advanced Level) Practise 1052 Linked List Sorting (25)
- PAT (Advanced Level) Practise 1052 Linked List Sorting (25)
- PAT (Advanced Level) Practise 1028 List Sorting (25)
- 【PAT】【Advanced Level】1052. Linked List Sorting (25)
- Pat(Advanced Level)Practice--1028(List Sorting)
- 1028. List Sorting (25)【排序】——PAT (Advanced Level) Practise
- 浙大 PAT Advanced level 1029. Median (25)
- 浙大PAT 1028题 1028. List Sorting
- Pat(Advanced Level)Practice--1052(Linked List Sorting)
- 浙大 PAT Advanced level 1025. PAT Ranking (25)
- PAT (Advanced) 1052. Linked List Sorting (25)
- PAT (Advanced Level) 1052. Linked List Sorting (25) 结构体排序
- 浙大 PAT Advanced level 1027. Colors in Mars (20)
- logback 常用配置详解(三) <filter>
- iOS 9 NEHotspotHelper 的NetworkExtension使用
- linux安装mysql
- 阐述final、finally、finalize的区别
- 浙大 PAT Advanced level 1028. List Sorting (25)
- 关于编程的时候使用自动化.
- 二分查找的递归写法和非递归写法
- Failed to connect sshd on "10.6.6.229:99"ProxyHTTP:java.io.IOException:proxy error:Service Unavailab
- java并发之Unsafe类
- 217. Contains Duplicate
- iOS开发wkwebview遇到的那些坑-canOpenURL
- 项目开发 实验室测试
- Java 的swing.GroupLayout布局管理器的使用方法和实例【图文说明】