题目链接:http://pat.zju.edu.cn/contests/pat-a-practise/1028

题目描述:

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

分析:

输入学生信息,按照指定项进行排序。当按照name或grade排序时如果存在一样的情况就按照学号递增的形式输出。

原本是想用c++做,num和name用string类型表示。但是用c++中的cin进行输入时会有一组数据在最终提交时超时。所以改用scanf输入。

由于scanf不能输入string类型,所以将string类型用char[]代替。

但是如果num和name都用char[]类型,在输出时又会出错,见“错误代码一”。

后面就将num为int型,为了满足num为6位的要求,要用printf("%06d",num) 这种形式输出。

错误代码一:

#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<vector>
#include<cstdio>
using namespace std; typedef struct student
{
    char num[6];
    char name[20];
    int grade;
}Student; int n;
bool comparison(Student a,Student b)
{
    if(n==1)
    {
        return strcmp(a.num,b.num)<0;
    }
    else if(n==2)
    {        
        if(strcmp(a.name,b.name) == 0)
            return strcmp(a.num,b.num);
        return strcmp(a.name,b.name)<0;
    }
    else if(n==3)
    {
        if(a.grade == b.grade)
            return strcmp(a.num,b.num) < 0;    
        return a.grade < b.grade;
    }        
} int main()
{
    int M;
    cin>>M>>n;
    vector<Student> s(M);
    int i;
    for(i=0; i<M; i++)
        //cin>>s[i].num>>s[i].name>>s[i].grade;
        scanf("%s%s%d",&s[i].num,&s[i].name,&s[i].grade);     sort(s.begin(),s.end(),comparison);
    for(i=0; i<M; i++)
        cout<<s[i].num<<" "<<s[i].name<<" "<<s[i].grade<<endl;     return 0;
}

最终的输出不正确。但是
原因是???


正确代码:

参考:http://blog.csdn.net/sunbaigui/article/details/8657115

#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<vector>
#include<cstdio>
using namespace std; typedef struct student
{
int num;
char name[20];
int grade;
}Student; int n;
bool comparison(Student a,Student b)
{
if(n==1)
{
return a.num<b.num;
}
else if(n==2)
{
if(strcmp(a.name,b.name) == 0)
return a.num<b.num;
return strcmp(a.name,b.name)<0;
}
else if(n==3)
{
if(a.grade == b.grade)
return a.num<b.num;
return a.grade < b.grade;
}
} int main()
{
int M;
cin>>M>>n;
vector<Student> s(M);
int i;
for(i=0; i<M; i++)
scanf("%d%s%d",&s[i].num,&s[i].name,&s[i].grade); sort(s.begin(),s.end(),comparison);
for(i=0; i<M; i++)
printf("%06d %s %d\n",s[i].num,s[i].name,s[i].grade); return 0;
}

【PAT】1028. List Sorting (25)的更多相关文章

  1. PAT 甲级 1028 List Sorting (25 分)(排序,简单题)

    1028 List Sorting (25 分)   Excel can sort records according to any column. Now you are supposed to i ...

  2. PAT 甲级 1028. List Sorting (25) 【结构体排序】

    题目链接 https://www.patest.cn/contests/pat-a-practise/1028 思路 就按照 它的三种方式 设计 comp 函数 然后快排就好了 但是 如果用 c++ ...

  3. 【PAT甲级】1028 List Sorting (25 分)

    题意: 输入一个正整数N(<=100000)和C(C属于{1,2,3}),接下来输入N行,每行包括学生的六位学号(习惯用string输入,因为可能有前导零),名字和成绩(正整数).输出排序后的信 ...

  4. 【PAT】1020 Tree Traversals (25)(25 分)

    1020 Tree Traversals (25)(25 分) Suppose that all the keys in a binary tree are distinct positive int ...

  5. 【PAT】1015 德才论 (25)(25 分)

    1015 德才论 (25)(25 分) 宋代史学家司马光在<资治通鉴>中有一段著名的“德才论”:“是故才德全尽谓之圣人,才德兼亡谓之愚人,德胜才谓之君子,才胜德谓之小人.凡取人之术,苟不得 ...

  6. 【PAT】1020. Tree Traversals (25)

    Suppose that all the keys in a binary tree are distinct positive integers. Given the postorder and i ...

  7. 【PAT】B1055 集体照(25 分)

    很简单的two points问题 ##注意:K是行数 #include<stdio.h> #include<string.h> #include<map> #inc ...

  8. 【PAT】1051 Pop Sequence (25)(25 分)

    Given a stack which can keep M numbers at most. Push N numbers in the order of 1, 2, 3, ..., N and p ...

  9. 【PAT】1063. Set Similarity (25) 待改进

    Given two sets of integers, the similarity of the sets is defined to be Nc/Nt*100%, where Nc is the ...

随机推荐

  1. JavaScript初步

    隐式转换 其他类型转换成布尔类型: undefined --> false null --> false 0或者0.0或者NaN --> false 字符串长度为0 --> f ...

  2. 【atcoder F - Namori】**

    F- Namori http://agc004.contest.atcoder.jp/tasks/agc004_f Time limit : 2sec / Memory limit : 256MB S ...

  3. jni java C/C++ 相互调用

    韩梦飞沙  韩亚飞  313134555@qq.com  yue31313  han_meng_fei_sha java 中  声明 一个 native 方法 用javah命令 生成 包含 nativ ...

  4. BZOJ1021 SHOI2008循环的债务

    dp模拟即可. d[i][j][k]表示使用前i种面值,1号手里钱为j,2号手里钱为k时最少操作数 使用滚动数组压缩空间 #include <cstdio> #include <cs ...

  5. [BZOJ4408&&BZOJ4299][FJOI2016 && Codechef]神秘数&&FRBSUM(主席树)

    4299: Codechef FRBSUM Time Limit: 10 Sec  Memory Limit: 128 MBSubmit: 550  Solved: 351[Submit][Statu ...

  6. 拉普拉斯(Laplace)分布

    Laplace分布的概率密度函数的形式是这样的: $p(x) = \frac{1}{2 \lambda} e^{-\frac{\vert x –\mu \vert}{\lambda}}$   一般$\ ...

  7. 读书笔记_Effective_C++_条款二十六:尽可能延后变量定义式的出现时间

    这个条款从字面意思还是很好理解的,就是在使用这个变量前才去定义,而不是很早就定义了它,而在很后面的时候才去使用.这个条款只适用于对变量声明位置没有要求的语言,比如C++.对于像C或者一些脚本语言,语法 ...

  8. iOS开发系列--音频播放、录音、

    音频 在iOS中音频播放从形式上可以分为音效播放和音乐播放.前者主要指的是一些短音频播放,通常作为点缀音频,对于这类音频不需要进行进度.循环等控制.后者指的是一些较长的音频,通常是主音频,对于这些音频 ...

  9. HDU 4496 D-City (并查集,水题)

    D-City Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65535/65535 K (Java/Others)Total Subm ...

  10. WICED™ <SMART> Software Development Kit

    WICED™ Software Development Kit The WICED™ SDK includes the tools and software needed to create Wi-F ...