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
    

    简单的一道题,只需要一个结构体,然后sort即可,用cin,cout会超时,用scanf,printf就好了。

    代码:

    #include <iostream>
    #include <cstdio>
    #include <cstring>
    #include <algorithm>
    using namespace std;
    int c;
    struct stu
    {
        int id,score;
        char name[9];
    }s[100000];
    bool cmp(stu a,stu b)
    {
        if(c==1)return a.id<b.id;
        else if(c==2)
        {
            if(strcmp(a.name,b.name)==0)return a.id<b.id;
            return strcmp(a.name,b.name)<0;//注意这里写的
        }
        else
        {
            if(a.score==b.score)return a.id<b.id;
            return a.score<b.score;
        }
    }
    int main()
    {
        int n;
        scanf("%d%d",&n,&c);
        for(int i=0;i<n;i++)
        {
           scanf("%d%s%d",&s[i].id,s[i].name,&s[i].score);
        }
        sort(s,s+n,cmp);
        for(int i=0;i<n;i++)
        {
            printf("%06d %s %d
    ",s[i].id,s[i].name,s[i].score);
        }
    }
  • 相关阅读:
    《ACM国际大学生程序设计竞赛题解I》——6.8
    数据结构篇
    从SG函数浅谈解决博弈问题的通法
    动态规划的泛式解题思路
    bzoj1057: [ZJOI2007]棋盘制作
    bzoj3884: 上帝与集合的正确用法
    bzoj1564: [NOI2009]二叉查找树
    bzoj4347: [POI2016]Nim z utrudnieniem
    bzoj1131: [POI2008]Sta
    bzoj1566: [NOI2009]管道取珠
  • 原文地址:https://www.cnblogs.com/8023spz/p/7461569.html
Copyright © 2011-2022 走看看