PAT甲级 1028. List Sorting (25)
来源:互联网 发布:日本电视台网络直播 编辑:程序博客网 时间:2024/05/18 03:35
题目:
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思路:
这个是排序函数的重写,但要注意不要用cin和cout,需要用scanf和printf,否则会超时。
代码:
#include<iostream>#include<string>#include<vector>#include<algorithm>#include<stdio.h>#include<string.h>using namespace std;struct stu{int id;char name[9]; //字符串不超过8个字母int grade;};bool comp1(const stu &s1, const stu &s2){return s1.id < s2.id;}bool comp2(const stu &s1, const stu &s2){if (strcmp(s1.name,s2.name)!=0){if (strcmp(s1.name, s2.name) < 0)return true;elsereturn false;}else{return s1.id < s2.id;}}bool comp3(const stu &s1, const stu &s2){if (s1.grade != s2.grade){return s1.grade < s2.grade;}else{return s1.id < s2.id;}}int main(){int N,C;cin >> N >> C;int i;//inputvector<stu> S(N);for (i = 0; i < N; ++i){scanf("%d%s%d", &(S[i].id), S[i].name, &(S[i].grade));}//sortswitch (C){case 1:{sort(S.begin(),S.end(),comp1);break;}case 2:{sort(S.begin(), S.end(), comp2);break;}case 3:{sort(S.begin(), S.end(), comp3);break;}}//outputfor (i = 0; i < N; ++i){printf("%06d %s %d\n",(S[i].id),S[i].name,(S[i].grade));}system("pause");return 0;}
- 【PAT甲级】1028. List Sorting (25)
- PAT(甲级)1028. List Sorting (25)
- 1028. List Sorting (25) PAT甲级
- PAT甲级练习1028. List Sorting (25)
- PAT甲级1028. List Sorting (25)
- 1028. List Sorting (25)-PAT甲级
- PAT甲级 1028. List Sorting (25)
- PAT甲级 1028. List Sorting (25)
- PAT 甲级 1028. List Sorting (25)
- PAT甲级 1028. List Sorting (25)
- 1028. List Sorting (25)-PAT甲级真题
- 【PAT甲级】1052. Linked List Sorting (25)
- 1052. Linked List Sorting (25) PAT甲级
- PAT甲级1052. Linked List Sorting (25)
- PAT 甲级 1052. Linked List Sorting (25)
- PAT甲级 1052. Linked List Sorting (25)
- PAT 甲级 1041 Linked List Sorting (25)
- 1052. Linked List Sorting (25)-PAT甲级真题
- C++STL中vector(可变大小数组)用法总结
- BZOJ 1086 [SCOI2005]王室联邦
- javax.xml.ws.WebServiceException
- LaTex(PART XVIII)\rule 标尺和支撑
- 解决intellij IDEA本地打不开页面
- PAT甲级 1028. List Sorting (25)
- fremarker 判断是否为null
- 深度纸质学习与实验(二)-真机搭建docker与kubernetes(补更)
- 马克飞象
- CountDownLatch
- javaSE_集合
- Python端口扫描程序原理解析
- tensorflow 神经网络入门例子
- C语言程序: 由姓名求成绩