成绩排名 (20)

复制代码

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

struct  Node
{
    string name;
    string id;
    int score;
};
const int maxn = 1005;

bool cmp(Node a, Node b){
    return a.score < b.score;
}

int main(){
    Node s[maxn];
    int t;
    cin >> t;
    for (int i = 0; i < t; i++){
        cin >> s[i].name >> s[i].id >> s[i].score;
    }
    sort(s, s + t, cmp);
    cout << s[t - 1].name << " " << s[t - 1].id << endl;
    cout << s[0].name << " " << s[0].id << endl;
    return 0;
}