PAT (Advanced Level) 1055. The World's Richest (25)

排序。随便加点优化就能过。

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

struct X
{
    char name[];
    int age;
    int val;
}s[+];
int n,k,cnt;
int ans[+];

bool cmp(const int &a,const int &b)
{
    if(s[a].val==s[b].val&&s[a].age==s[b].age)
        return strcmp(s[a].name,s[b].name)<;
    if(s[a].val==s[b].val) return s[a].age<s[b].age;
    return s[a].val>s[b].val;
}

bool CMP(const X&a,const X&b)
{
    if(a.val==b.val&&a.age==b.age)
        return strcmp(a.name,b.name)<;
    if(a.val==b.val) return a.age<b.age;
    return a.val>b.val;
}

int main()
{
    scanf("%d%d",&n,&k);
    for(int i=;i<=n;i++)
        scanf("%s%d%d",s[i].name,&s[i].age,&s[i].val);
    sort(s+,s++n,CMP);
    for(int i=;i<=k;i++)
    {
        int a,b,c; scanf("%d%d%d",&a,&b,&c);
        cnt=;
        for(int j=;j<=n;j++){
            if(s[j].age>=b&&s[j].age<=c) ans[cnt++]=j;
            if(cnt==a) break;
        }
        printf("Case #%d:\n",i);
        if(cnt==) printf("None\n");
        else
        {
            sort(ans,ans+cnt,cmp);
            for(int j=;j<min(a,cnt);j++)
                printf("%s %d %d\n",s[ans[j]].name,s[ans[j]].age,s[ans[j]].val);
        }
    }
    return ;
}