#include<bits/stdc++.h> using namespace std; struct student{ int ch[1001]; string name[1001]; }a;

int main(){ int n,max=0; cin>>n; for(int i=1;i<=n;i++){ cin>>a.ch[i]>>a.name[i]; if(a.ch[i]>max){ max=a.ch[i]; } } for(int i=1;i<=n;i++){ if(max==a.ch[i]) cout<<a.name[i]; } return 0; }

#include<bits/stdc++.h> using namespace std; struct stu{ int score; string name; }a[105],ans; int main(){ int n; cin>>n; ans.score=0; for(int i=1;i<=n;i++){ cin>>a[i].score>>a[i].name; if(a[i].score>ans.score){ ans = a[i]; } } cout<<ans.name; return 0; }

#include <iostream>
#include <string>
using namespace std;

int main()
{
	int N;
	cin >> N;
	
	int score = 0;
	string name = "";
	
	int max_score = 0; // 最高分；
	string ans = "";
	
	for (int i = 0; i < N; i++)
	{
		cin >> score >> name;
		if (score > max_score)
		{
			max_score = score; // 更新最高分；
			ans = name;
		}
	}
	cout << ans << endl;
    return 0;
}

using namespace std;
int main()
{
	int n=0;
	cin >> n;
	int maxScore=0;
	string maxName;
	for(int i=1;i<=n;i++)
	{
		int score;
		string name;
		cin>>score>>name;
		if(score>maxScore)
		{
			maxScore = score;
			maxName = name;
		}
	}
	cout<<maxName<<endl;
	return 0;
}这个简单易理解

#include<cstring>
#include<algorithm>
using namespace std; 
struct Stu
{
	int score;
	string stuName;
}stu[110];
bool cmp(Stu a,Stu b)
{
	return a.score>b.score;
}
int main(){
	int n;
	cin>>n;
	for(int i=1;i<=n;i++) cin>>stu[i].score>>stu[i].stuName;
	sort(stu+1,stu+n+1,cmp);
	cout<<stu[1].stuName;
}

#include<bits/stdc++.h>
using namespace std;
int n;
struct s{
	int score;
	string name;
}a[101],ans;
int main(){
	cin>>n;
	ans.score=0;
	for(int i=1;i<=n;i++){
		cin>>a[i].score>>a[i].name;
		if(a[i].score>=ans.score)ans=a[i];
	}
    cout<<ans.name;
    return 0;
}

高级点的