题解

#include<iostream>
#include<algorithm>
using namespace std;
struct lunch{
	string name;
	int much,nice;
}a[50];
bool cmp(lunch x,lunch y){
    return x.nice>y.nice;
}
int main(){
	int n,m;
    cin>>n>>m;
	for(int i=0;i<n;i++){
		cin>>a[i].name>>a[i].much>>a[i].nice;
	}
	sort(a,a+n,cmp);
	for(int i=0;i<n;i++){
		if(a[i].much<=m){
			cout<<a[i].name<<' '<<a[i].much<<' '<<a[i].nice;
            return 0;
		} 
	}
	cout<<"...>_<...";
    return 0;
}