PAT甲级 1028. List Sorting (25)
来源:互联网 发布:如何做淘宝详情页 编辑:程序博客网 时间:2024/06/05 12:39
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 <iostream>#include <algorithm>#include<string.h>#include<cstdio>using namespace std;struct stu{ int num; char name[10]; int grade;};bool cmp1(stu a,stu b){ return a.num<b.num;}bool cmp2(stu a,stu b){ if(strcmp(a.name,b.name)!=0) return strcmp(a.name,b.name)<0; return a.num<b.num;}bool cmp3(stu a,stu b){ if(a.grade!=b.grade) return a.grade<b.grade; return a.num<b.num;}stu s[100005];int main(){ int n,c; scanf("%d %d",&n,&c); for(int i=1;i<=n;i++) { scanf("%d %s %d",&s[i].num,s[i].name,&s[i].grade); } if(c==1) { sort(s+1,s+n+1,cmp1); for(int i=1;i<=n;i++) { printf("%06d %s %d\n",s[i].num,s[i].name,s[i].grade); } } if(c==3) { sort(s+1,s+n+1,cmp3); for(int i=1;i<=n;i++) { printf("%06d %s %d\n",s[i].num,s[i].name,s[i].grade); } } if(c==2) { sort(s+1,s+n+1,cmp2); for(int i=1;i<=n;i++) { printf("%06d %s %d\n",s[i].num,s[i].name,s[i].grade); } } 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++ 零散重要知识点
- Java 关于HashTable和SynchronizedMap线程安全的分析
- Scala class和case class的区别
- gRPC开发入门
- 解决scrapy存储json中文默认为Unicode编码问题
- PAT甲级 1028. List Sorting (25)
- 数组和列表的选择
- Pycharm DataBase Navigator Plugins 使用
- 卷积神经网络LeNet5,基于TensorFlow的实现
- Hadoop常用指令
- node.js使用(四):采集网页
- 十年磨剑服务健康事业
- 动态规划——1087 Super Jumping! Jumping! Jumping!
- windows 安装ninja