#include<bits/stdc++.h> using namespace std; struct fn{ string mz; int jl; }; int main(){ fn a[11]; int n,minn=10005,dg; cin>>n; for(int i=0;i<n;i++){ cin>>a[i].mz>>a[i].jl; if(minn>a[i].jl){ minn=a[i].jl; dg=i; } } if(minn<100){ cout<<a[dg].mz; } else{ cout<<"died!"; } } 没加换行，自己加上；复杂度是O(n)，应该挺好