PAT (Advanced Level) Practise 1028 List Sorting (25)
来源:互联网 发布:无忧seo 编辑:程序博客网 时间:2024/06/02 19:29
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
题意:给出n条记录,记录包括id,姓名和分数,然后有三种排序,第一种是id按字典序排,第二种是姓名按字典序排,姓名一样的id按字典序排,第三种是按分数从小到大排,分数一样的id按字典序排
#include <iostream>#include <cstdio>#include <string>#include <cstring>#include <algorithm>#include <cmath>#include <queue>#include <stack>#include <vector>using namespace std;#define ll long longconst int INF=0x3f3f3f3f;const int maxn=1e5+10;int n,m,score[maxn],ans[maxn];char id[maxn][10],name[maxn][10];bool cmp1(const int x,const int y){ return strcmp(id[x],id[y])<0;}bool cmp2(const int x,const int y){ if(strcmp(name[x],name[y])) return strcmp(name[x],name[y])<0; else return strcmp(id[x],id[y])<0;}bool cmp3(const int x, const int y){ if(score[x]!=score[y]) return score[x]<score[y]; else return strcmp(id[x],id[y])<0;}int main(){ scanf("%d %d",&n,&m); for(int i=0;i<n;i++) { scanf("%s %s %d",id[i],name[i],&score[i]); ans[i]=i; } if(m==1) sort(ans,ans+n,cmp1); if(m==2) sort(ans,ans+n,cmp2); if(m==3) sort(ans,ans+n,cmp3); for(int i=0;i<n;i++) printf("%s %s %d\n",id[ans[i]],name[ans[i]],score[ans[i]]); return 0;}
- PAT (Advanced Level) Practise 1028 List Sorting (25)
- PAT (Advanced Level) Practise 1028 List Sorting (25)
- 1028. List Sorting (25) @ PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise 1052 Linked List Sorting (25)
- PAT (Advanced Level) Practise 1052 Linked List Sorting (25)
- 1028. List Sorting (25)【排序】——PAT (Advanced Level) Practise
- 1052. Linked List Sorting (25)【链表+排序】——PAT (Advanced Level) Practise
- Pat(Advanced Level)Practice--1028(List Sorting)
- 【PAT】【Advanced Level】1028. List Sorting (25)
- PAT (Advanced Level) Practise 1047 Student List for Course (25)
- PAT (Advanced Level) Practise 1074 Reversing Linked List (25)
- PAT (Advanced Level) Practise 1083 List Grades (25)
- PAT (Advanced Level) Practise 1083 List Grades (25)
- PAT (Advanced Level) Practise 1074 Reversing Linked List (25)
- PAT (Advanced Level) Practise 1047 Student List for Course (25)
- PAT (Advanced Level) Practise 1039 Course List for Student (25)
- 【C++】PAT(advanced level)1028. List Sorting (25)
- PAT (Advanced Level) 1028. List Sorting (25) 结构体排序
- 设计模式--工厂模式 ➪〖 简单工厂模式+工厂方法模式 〗
- 文章标题
- Expand Search Form Maximum subarray problem (Kadane’s algorithm)
- Unity中加载资源的方法
- WebGL之旅(六)动画
- PAT (Advanced Level) Practise 1028 List Sorting (25)
- 基于 Node.js + Express + mongoDB + Bootstrap 搭建的电影网站
- Linux history显示时间
- 浅谈CSRF攻击方式
- Python基础——list.append() 与 list.extend() 的区别
- Codeforces 830A, Binary Search
- hibernate criteria一对多查询,并对多方的集合数据进行过滤,返回部分集合
- spring boot整合cxf发布webservice服务和cxf客户端调用
- 深浅拷贝