zoukankan      html  css  js  c++  java
  • 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 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>
    using namespace std;
    #include<cstdio>
    #include<algorithm>
    #include<cstring>
    struct Stu{
    	int grade;
    	char id[10];
    	char name[10];
    };
    Stu stu[100002];
    bool cmp_id(Stu s1,Stu s2){
    	return strcmp(s1.id,s2.id)<0;
    }
    bool cmp_name(Stu s1,Stu s2){
    	if(strcmp(s1.name,s2.name)<0||(strcmp(s1.name,s2.name)==0&&strcmp(s1.id,s2.id)<0)){
    		return 1;
    	}
    	return 0;
    }
    bool cmp_grade(Stu s1,Stu s2){
    	if(s1.grade<s2.grade||(s1.grade==s2.grade&&strcmp(s1.id,s2.id)<0)){
    		return 1;
    	}
    	return 0;
    }
    int main(){
    	int n,c;
    	int i,j;
    	scanf("%d%d",&n,&c);
    	getchar();
    	for(i=0;i<n;i++){
    		cin>>stu[i].id>>stu[i].name>>stu[i].grade;
    	}
    	if(c == 1){
    		sort(stu,stu+n,cmp_id);
    	}else if(c == 2){
    		sort(stu,stu+n,cmp_name);
    	}else{
    		sort(stu,stu+n,cmp_grade);
    	}
    	for(i=0;i<n;i++){
    		printf("%s %s %d
    ",stu[i].id,stu[i].name,stu[i].grade);
    	}
    }
    

      

  • 相关阅读:
    mysql-索引与优化
    sql优化
    PHP高并发
    MySQL 数据类型
    ERROR 2013 (HY000): Lost connection to MySQL server
    建模各阶段以及相关UML构造笔记
    Code Complete 笔记—— 第二章 用隐喻来更充分理解软件开发
    Code Complete 笔记—— 第一章
    Laravel使用笔记 —— migration
    本地xdebug调试搭建 Laravel+homestead+phpstorm
  • 原文地址:https://www.cnblogs.com/grglym/p/7690623.html
Copyright © 2011-2022 走看看