1028. List Sorting (25)
来源:互联网 发布:分答和知乎 编辑:程序博客网 时间:2024/06/13 05:03
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<iostream>#include<algorithm>#include<vector>#include<string>using namespace std;struct node{ int id,grade; string name; node(){ cin>>id>>name>>grade; }};bool cmp1(node a,node b){ return a.id<b.id;}bool cmp2(node a,node b){ if(a.name!=b.name) return a.name<b.name; return a.id<b.id;}bool cmp3(node a,node b){ if(a.grade!=b.grade) return a.grade<b.grade; return a.id<b.id;}vector<node> s;int main(){ int n,c; scanf("%d%d",&n,&c); for(int i=0;i<n;i++){ s.push_back(node()); } switch (c){ case 1: sort(s.begin(),s.end(),cmp1); break; case 2: sort(s.begin(),s.end(),cmp2); break; case 3: sort(s.begin(),s.end(),cmp3); break; } for(int i=0;i<n;i++){ printf("%06d ",s[i].id); cout<<s[i].name; printf(" %d\n",s[i].grade); } return 0;}
- 1028. List Sorting (25)
- 1028. List Sorting (25)
- 1028. List Sorting (25)
- 1028. List Sorting (25)
- 1028. List Sorting (25)
- 1028. List Sorting (25)
- 1028. List Sorting (25)
- 1028. List Sorting (25)
- 1028. List Sorting (25)
- 1028. List Sorting (25)
- 1028. List Sorting (25)
- 1028. List Sorting (25)
- 1028. List Sorting (25)
- 1028. List Sorting (25)
- 1028. List Sorting (25)
- 1028. List Sorting (25)
- 1028. List Sorting (25)
- 1028. List Sorting (25)
- 4.1.3.3 Android 网络状态监听的静态广播接受者和动态广播接受者Broadcast-Receiver
- ZOJ 3785 11th省赛 J What day is that day?【打表找规律】
- 线性表
- 创客工具汇总及介绍
- 写个函数用来对二维数组排序(新浪)
- 1028. List Sorting (25)
- 尺度不变特征变换(SIFT)算法介绍
- 数据库中join和left join的区别
- 《leetCode》:Best Time to Buy and Sell Stock II
- [CodeVS2822]爱在心中 做题笔记
- ViewPager 详解(一)---基本入门
- Python计算机视觉:第九章 图像分割
- [iOS]Objective-C Method Swizzling
- C++中的RVO和NRVO