#include<bits/stdc++.h>
using namespace std;
typedef struct{
    string name;
    int g;
}fengnai;
bool cmp(fengnai a,fengnai b)
{
    return a.g<b.g;
}
int main(){
    int n;
    cin>>n;
    fengnai f[n];
    for(int i=0;i<n;i++){
        cin>>f[i].name>>f[i].g;
    }
    sort(f,f+n,cmp);
	        if(f[0].g>=100){
	            cout<<"died!";}
	        else{
	            cout<<f[0].name;
	        }
}

结构体练手~

#include<bits/stdc++.h>
using namespace std;

struct ac{
    string name;
    int s;
}a[11];

bool c(ac a,ac b){
    return a.s<b.s;
}

int main(){
    int n;
    cin>>n;
    for(int i=0;i<n;i++) cin>>a[i].name>>a[i].s;
    sort(a,a+n,c);
    if(a[0].s>=100){
        cout<<"died!";
        return 0;
    }
    if(a[0].s<100){
        cout<<a[0].name;
        return 0;
    }
}

#include<bits/stdc++.h> using namespace std; typedef struct{ string name; int g; }fengnai; bool cmp(fengnai a,fengnai b) { return a.g<b.g; } int main(){ int n; cin>>n; fengnai f[n]; for(int i=0;i<n;i++){ cin>>f[i].name>>f[i].g; } sort(f,f+n,cmp); if(f[0].g>=100){ cout<<"died!";} else{ cout<<f[0].name; } }

#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)，应该挺好