AC题解，用sort排序。

#include<bits/stdc++.h>
using namespace std;
struct student{
string name;
int jiage;
int hyd;
}ac[10000];
bool cmp(student n,student m){
if(n.hyd>m.hyd){
return n.hyd>m.hyd;
}
else if(n.hyd==m.hyd){
if(n.jiage>m.jiage)
return n.jiage>m.jiage;
return 0;
}
return 0;
}
int main(){
long long n,m;
cin>>n>>m;
for(int i=0;i<n;i++){
cin>>ac[i].name>>ac[i].jiage>>ac[i].hyd;
}
sort(ac,ac+n,cmp);
for(int i=0;i<n;i++){
if(ac[i].jiage<=m){
cout<<ac[i].name<<" "<<ac[i].jiage<<" "<<ac[i].hyd<<endl;
return 0;
}
}
cout<<"...>_<..."<<"\n";
}