1055. The World's Richest 解析

按题目给出的年龄范围输出排序的问题。直接排好序，按要求输出就好。

#include <iostream>#include <algorithm>#include <cstring>#include <string>#include <vector>#include <map>#include <queue>#include <stack>#define MAX 100010using namespace std;int n,k;int m,mina,maxa;struct node{char name[9];int age;int worth;};node l[MAX];bool cmp(node n1,node n2){if(n1.worth != n2.worth)return n1.worth > n2.worth;else if(n1.age != n2.age)return n1.age < n2.age;elsereturn strcmp(n1.name,n2.name) < 0;}int main(){scanf("%d%d",&n,&k);for(int i = 0 ; i < n ;i++){scanf("%s%d%d",l[i].name,&l[i].age,&l[i].worth);}sort(&l[0],&l[0]+n,cmp);for(int i = 1 ;i <= k ;i ++){printf("Case #%d:\n",i);int size = 0;scanf("%d%d%d",&m,&mina,&maxa);int j = 0;while(j < n && size < m){if(l[j].age <= maxa && l[j].age >= mina){printf("%s %d %d\n",l[j].name,l[j].age,l[j].worth);size++;}j++;}if(size == 0)printf("None\n");}return 0;}