每输入一行,就去判断是否会更新min或max学生即可;
注意可能会最高最低同为1人,如n=1的情况。
代码:
#include <iostream>
#include <string>
using namespace std;
int main()
{
int n, score, minn_score=101, maxx_score=-1;
string name, id, minn_name, minn_id, maxx_name, maxx_id;
cin >> n;
while (n --)
{
cin >> name >> id >> score;
if (score < minn_score)
{
minn_name = name;
minn_id = id;
minn_score = score;
}
if (score > maxx_score)
{
maxx_name = name;
maxx_id = id;
maxx_score = score;
}
}
cout << maxx_name << " " << maxx_id << endl;
cout << minn_name << " " << minn_id << endl;
return 0;
}