PAT (Advanced Level) 1083. List Grades (25)

简单排序。

#include<cstdio>
#include<cstring>
#include<cmath>
#include<vector>
#include<map>
#include<stack>
#include<queue>
#include<string>
#include<iostream>
#include<algorithm>
using namespace std;

struct X
{
    string s;
    string c;
    int g;
}p[100000];
int n;

bool cmp(const X&a,const X&b)
{
    return a.g>b.g;
}

int main()
{
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
        cin>>p[i].s>>p[i].c>>p[i].g;
    sort(p+1,p+1+n,cmp);

    int flag=0;
    int L,U; scanf("%d%d",&L,&U);
    for(int i=1;i<=n;i++)
    {
        if(p[i].g>=L&&p[i].g<=U)
        {
            cout<<p[i].s<<" "<<p[i].c<<endl;
            flag=1;
        }
    }
    if(flag==0) printf("NONE
");
    return 0;
}