速度最快的代码

#include<cstdio>
#include<algorithm>
using namespace std;
int n;
struct student{
    int id,a,b,c,ma;
}a[305];
bool cmp(student x,student y){
    if(x.ma!=y.ma)
        return x.ma>y.ma;
    else if(x.a!=y.a)
        return x.a>y.a;
    return x.id<y.id;
}
int main(){
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        scanf("%d%d%d",&a[i].a,&a[i].b,&a[i].c);
        a[i].id=i;
        a[i].ma=a[i].a+a[i].b+a[i].c;
    }
    sort(a+1,a+n+1,cmp);
    for(int i=1;i<=5;i++)
        printf("%d %d\n",a[i].id,a[i].ma);
    return 0;
}

yasuo👀️

#include <iostream>
#include <algorithm>
struct stu{short id,y,s,e,sum;}stud[305];
short yasuo(stu a,stu b){
    if(a.sum!=b.sum)return a.sum>b.sum;
    else if (a.y!=b.y)return a.y>b.y;
    return a.id<b.id;}
int main(){
    short n,a[3],sum; std::cin>>n;
    for(int i=1;i<=n;i++){
        std::cin>>a[0]>>a[1]>>a[2]; sum=a[0]+a[1]+a[2];
        stud[i]={i,a[0],a[1],a[2],sum};}
    std::sort(stud+1,stud+n+1,yasuo);
    for(int i=1;i<=5;i++)
        std::cout<<stud[i].id<<" "<<stud[i].sum<<"\n";
    return 0;}