不要小看我们之间的羁绊啊！出来吧！迪迦！

#include<bits/stdc++.h>
using namespace std;
struct node
{
    string name;
    int sheng;
    int nian;
};
int main()
{
    int n,max = 0,cnt;
    node a[1005];
    cin>>n;
    for(int i = 1;i<=n;i++)
    {
        cin>>a[i].name>>a[i].sheng>>a[i].nian;
        if(a[i].sheng>max)
        {
            max = a[i].sheng;
            cnt = i;
        }
    }
    
    for(int i = 1;i<=n;i++)
    {
     if(max == a[i].sheng)
     {
         if(a[i].nian<a[cnt].nian)
         {
             cout<<a[i].name<<" "<<a[i].sheng<<" "<<a[i].nian;
             return 0;
         }  


     }   
    }
    cout<<a[cnt].name<<" "<<a[cnt].sheng<<" "<<a[cnt].nian;
    return 0;
}