AixsCode

知道怎么用是一回事,深入理解又是另一回事了

List Sorting (25)

List Sorting (25)

时间限制 1000 ms 内存限制 65536 KB 代码长度限制 100 KB 判断程序 Standard (来自 小小)
题目描述
Excel can sort records according to any column. Now you are supposed to imitate this function.

输入描述:
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).

输出描述:
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.

输入例子:
3 1
000007 James 85
000010 Amy 90
000001 Zoe 60

输出例子:
000001 Zoe 60
000007 James 85
000010 Amy 90

题解:就是排序问题,这里关键在于对结构体的设置,要是string的话直接比较大小,要是设置char[]数组 两个char[]无法直接比较大小,通过strcmp来进行比较

#include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
#define vi vector<int>
#define pii pair<int,int>
#define x first
#define y second
#define all(x) x.begin(),x.end()
#define pb push_back
#define mp make_pair
#define SZ(x) x.size()
#define rep(i,a,b) for(int i=a;i<b;i++)
#define per(i,a,b) for(int i=b-1;i>=a;i--)
#define pi acos(-1)
#define mod 1000000007
#define inf 1000000007
#define ll long long
#define DBG(x) cerr<<(#x)<<"="<<x<<"\n";
#define N 200010
template <class U,class T> void Max(U &x, T y){if(x<y)x=y;}
template <class U,class T> void Min(U &x, T y){if(x>y)x=y;}
template <class T> void add(int &a,T b){a=(a+b)%mod;}
const int maxn=100001;
struct stu
{
    string id;
    string name;
    int sc;
}s[maxn];
bool cmp1(stu s1,stu s2)
{
    return s1.id<s2.id;
}
bool cmp2(stu s1,stu s2)
{
    if(s1.name!=s2.name) return s1.name<s2.name;
    else return s1.id<s2.id;
}
bool cmp3(stu s1,stu s2)
{
    if(s1.sc!=s2.sc) return s1.sc<s2.sc;
    else return s1.id<s2.id;
}
int main()
{
    int n,m;
    cin>>n>>m;
    rep(i,0,n)
    {
        cin>>s[i].id>>s[i].name>>s[i].sc;
    }
    if(m==1) sort(s,s+n,cmp1);
    if(m==2) sort(s,s+n,cmp2);
    if(m==3) sort(s,s+n,cmp3);

    rep(i,0,n)
    {
        //cin>>s[i].id>>s[i].name>>s[i].sc;
        cout<<s[i].id<<" "<<s[i].name<<" "<<s[i].sc<<endl;
    }
    return 0;
}
阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/w_x_s_h_h/article/details/80317004
文章标签: PAT ACM sort
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

不良信息举报

List Sorting (25)

最多只允许输入30个字

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭