1055. The World's Richest (25)

#include <stdio.h>
#include <vector>
#include<string.h>
#include<algorithm>
using namespace std;

struct MyStruct
{
    char name[9];
    int age,worth;
};

int cmp(MyStruct a,MyStruct b)
{
    if(a.worth!=b.worth) return a.worth>b.worth;
    else
    {
        if(a.age!=b.age) return a.age<b.age;
        else
        {
            return (strcmp(a.name,b.name)<0);
        }
    }
}

int main()
{
    int n,k,i,j,Max,low,high;
    while(scanf("%d %d",&n,&k)!=EOF)
    {
        vector<MyStruct> vv;
        for(i=0;i<n;i++)
        {
            getchar();
            MyStruct tem;
            scanf("%s %d %d",tem.name,&tem.age,&tem.worth);
            vv.push_back(tem);
        }

        sort(vv.begin(),vv.end(),cmp);

        vector<MyStruct> VV2;
        int Age[201];
        for(i=1;i<=200;i++)
            Age[i]=0;

        for(i=0;i<n;i++)
            if(Age[vv[i].age]<100)
            {
                ++Age[vv[i].age];
                VV2.push_back(vv[i]);
            }

        for(i=0;i<k;i++)
        {
            getchar();
            scanf("%d %d %d",&Max,&low,&high);
            printf("Case #%d:\n",i+1);
            
            int printNum = 0;

            for(j=0;j<VV2.size() && printNum < Max ;j++)
            {
                if( VV2[j].age >= low && VV2[j].age <= high )
                {
                    printf("%s %d %d\n",VV2[j].name,VV2[j].age,VV2[j].worth);
                    ++printNum;
                }
            }

            if(printNum==0) printf("None\n");
            
        }
    }
   return 0;
}