AcWing 429. 奖学金
原题链接
简单
作者:
高小呆
,
2021-01-18 11:22:51
,
所有人可见
,
阅读 428
//sort函数的用法:https://baike.baidu.com/item/sort%E5%87%BD%E6%95%B0/11042699?fr=aladdin
#include<iostream>
#include<algorithm>
#include<map>
#include<utility>
using namespace std;
const int N = 310;
struct stu
{
int id;
int chinese;
int math;
int english;
int sum;
}s[310];
//告诉sort我希望降序排列
bool cmp(stu s1,stu s2)
{
if(s1.sum!=s2.sum) return s1.sum>s2.sum;
if(s1.chinese!=s2.chinese) return s1.chinese>s2.chinese;
return s1.id<s2.id;
}
int main()
{
int n;
cin>>n;
for(int i=1;i<=n;i++)
{
s[i].id=i;
cin>>s[i].chinese>>s[i].math>>s[i].english;
s[i].sum=s[i].chinese+s[i].math+s[i].english;
}
sort(s+1,s+n+1,cmp);
for(int i=1;i<=5;i++)
cout<<s[i].id<<" "<<s[i].sum<<endl;
return 0;
}