1055. The World's Richest

Forbes magazine publishes every year its list of billionaires based on the annual ranking of the world‘s wealthiest people. Now you are supposed to simulate this job, but concentrate only on the people in a certain range of ages.
That is, given the net worths of N people, you must find the M richest people in a given range of their ages.

Input Specification:

Each input file contains one test case. For each case, the first line contains 2 positive integers: N (<=10⁵) - the total number of people, and K (<=10³) - the number
of queries. Then N lines follow, each contains the name (string of no more than 8 characters without space), age (integer in (0, 200]), and the net worth (integer in [-10⁶, 10⁶]) of a person.
Finally there are K lines of queries, each contains three positive integers: M (<= 100) - the maximum number of outputs, and [Amin, Amax] which are the range of ages. All the numbers in a line are separated by a space.

Output Specification:

For each query, first print in a line "Case #X:" where X is the query number starting from 1. Then output the M richest people with their ages in the range [Amin, Amax]. Each person‘s information occupies a line, in the format

Name Age Net_Worth

The outputs must be in non-increasing order of the net worths.
In case there are equal worths, it must be in non-decreasing order of the ages. If both worths and ages are the same, then the output must be in non-decreasing alphabetical order of the names. It is guaranteed that there is no two persons share all the same
of the three pieces of information. In case no one is found, output "None".

又超时……

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
#include <algorithm>
using namespace std;
typedef struct
{
        char name[9];
        int age;
        long worth;
        }Node;
vector<Node> people;
vector<Node> query;
void Find(int min,int max,vector<Node> &query);
bool cmp (Node a,Node b);
int main ()
{
    int i,j,n,k;
    scanf("%d %d",&n,&k);
    Node temp;
    for( i=0;i<n;i++)
    {
         scanf("%s %d %ld",temp.name,&temp.age,&temp.worth);
         people.push_back(temp);
         }
    int m,min,max,length;
    for( i=1;i<=k;i++)
    {
         query.clear();
         scanf("%d %d %d",&m,&min,&max);
         printf("Case #%d:\n",i);
         Find(min,max,query);
         length=query.size();
         if( length==0)
         {
             printf("None\n");
             continue;
             }
         sort(query.begin(),query.end(),cmp);
         for( j=0;j<m&&j<length;j++)
         {
              printf("%s %d %ld\n",query[j].name,query[j].age,query[j].worth);
              }
         }
    system("pause");
    return 0;
    }
bool cmp (Node a,Node 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;
     }
void Find(int min,int max,vector<Node> &query)
{
     int i,length=people.size();
     Node temp;
     for( i=0;i<length;i++)
     {
          temp=people[i];
          if( temp.age>=min && temp.age<=max) query.push_back(temp);
          }
     }

1055. The World's Richest