1004 成绩排名 （20 分）

题目链接:https://pintia.cn/problem-sets/994805260223102976/problems/994805321640296448

AC代码:

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;

const int maxn=100010;
struct student{
    char name[11];//定义成char name[10]只会得2分，
    char number[11];//同理
    int score;
}stu[maxn];


bool cmp(struct student &a,struct student &b){
    return a.score>b.score;
}

int main(){
    int n;
    scanf("%d",&n);
    for(int i=0;i<n;i++){
        scanf("%s %s %d",stu[i].name,stu[i].number,&stu[i].score);
    }
    sort(stu,stu+n,cmp);
    printf("%s %s\n",stu[0].name,stu[0].number);
    printf("%s %s",stu[n-1].name,stu[n-1].number);
    return 0;
}

利用set排序:

#include <iostream>
#include <cstdio>
#include <set>
using namespace std;
typedef struct{
    char name[11];
    char number[11];
    int score;
}student;
struct Rule{
    bool operator()(const student &s1,const student &s2){
        return s1.score>s2.score;
    }
};

int main(){
    int n;
    set<student,Rule> st;
    scanf("%d",&n);
    student stu[n];
    for(int i=0;i<n;i++){
        scanf("%s %s %d",stu[i].name,stu[i].number,&stu[i].score);
        st.insert(stu[i]);
    }
    multiset<student>::iterator p;
    p=st.begin();
    cout<<p->name<<" "<<p->number<<endl;
    p=st.end();
    p--;
    cout<<p->name<<" "<<p->number<<endl;
    return 0;
}