#include <iostream>
#include<cstring>
#include<algorithm>
using namespace std;
struct node{
string name;
int score[10];
int sum;
}arr[100];
bool cmp(node a,node b){
if(a.sum!=b.sum)
return a.sum>b.sum;
if(a.score!=b.score)
return a.score>b.score;
}
int main()
{
int n,m;
int maxn=0,minn=100;
int cnt;
int score_sum=0;
cin>>n>>m;
for(int i=0;i<n;i++){
cin>>arr[i].name;
for(int j=0;j<m;j++){
cin>>arr[i].score[j];
}
}
for(int i=0;i<n;i++){
cnt=0;
score_sum=0;
//cout<<arr[i].name;
for(int j=0;j<m;j++){
if(maxn<arr[i].score[j]){
maxn=arr[i].score[j];
}
if(minn>arr[i].score[j]){
minn=arr[i].score[j];
}
score_sum+=arr[i].score[j];
}
cnt=maxn+minn;
arr[i].sum=score_sum-cnt;
}
sort(arr,arr+n,cmp);
for(int i=0;i<2;i++){
cout<<arr[i].name<<" ";
}
return 0;
}
结构体_成绩排序(去掉最高分和最低分)
最新推荐文章于 2023-12-26 11:44:11 发布