AC CODE
```cpp
#include <bits/stdc++.h>
using namespace std;
const int M = 3e2 + 10;
int n;
struct NODE {
int id, chi, math, eng, sum;
} infor[M];
bool cmp(NODE x, NODE y) {
if(x.sum == y.sum) {
if(x.chi != y.chi) return x.chi > y.chi;
else return x.id < y.id;
}
return x.sum > y.sum;
}
int main() {
cin >> n;
for(int i = 0; i < n; ++i) {
cin >> infor[i].chi >> infor[i].math >> infor[i].eng;
infor[i].id = i + 1;
infor[i].sum = infor[i].chi + infor[i].math + infor[i].eng;
}
sort(infor, infor + n, cmp);
for(int i = 0; i < 5; ++i) {
cout << infor[i].id << " " << infor[i].sum << endl;
}
return 0;
}
```
by Administrator2023 @ 2024-03-13 17:23:46
AC代码```cpp
#include <bits/stdc++.h>
using namespace std;
struct student
{
int yu;
int shu;
int ying;
int zong;
int i;
}si[305];
bool cmp(student a,student b)
{
a.zong=a.yu+a.shu+a.ying;
b.zong=b.yu+b.shu+b.ying;
if(a.zong==b.zong)
{
if(a.yu!=b.yu)
{
return a.yu>b.yu;
}
else
{
return a.i<b.i;
}
}
return a.zong>b.zong;
}
int main()
{
int n;
cin >>n;
for(int i=1;i<=n;i++)
{
cin >>si[i].yu>>si[i].shu>>si[i].ying;
si[i].i=i;
}
sort(si+1,si+n+1,cmp);
for(int i=1;i<=5;i++)
{
cout <<si[i].i<<" "<<si[i].yu+si[i].shu+si[i].ying<<endl;
}
return 0;
}
```
by efdfw @ 2024-03-31 21:23:59
@[efdfw](/user/1295871)
Ac代码
```cpp
#include <bits/stdc++.h>
using namespace std;
struct student
{
int yu;
int shu;
int ying;
int zong;
int i;
}si[305];
bool cmp(student a,student b)
{
a.zong=a.yu+a.shu+a.ying;
b.zong=b.yu+b.shu+b.ying;
if(a.zong==b.zong)
{
if(a.yu!=b.yu)
{
return a.yu>b.yu;
}
else
{
return a.i<b.i;
}
}
return a.zong>b.zong;
}
int main()
{
int n;
cin >>n;
for(int i=1;i<=n;i++)
{
cin >>si[i].yu>>si[i].shu>>si[i].ying;
si[i].i=i;
}
sort(si+1,si+n+1,cmp);
for(int i=1;i<=5;i++)
{
cout <<si[i].i<<" "<<si[i].yu+si[i].shu+si[i].ying<<endl;
}
return 0;
}
```
by efdfw @ 2024-03-31 21:24:47