题解

#include<bits/stdc++.h>
using namespace std;
struct nnn{
string s;
int c,d;
char e,f;
int r,k,l;
}a[109];
bool cmp(nnn h,nnn m){
if(h.km.k){
return h.l<m.l;
}else{
return h.k>m.k;
}
}
int main(){
int n;
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i].s>>a[i].c>>a[i].d>>a[i].e>>a[i].f>>a[i].r;
a[i].l=i;
}
for(int i=1;i<=n;i++){
if(a[i].c>80&a[i].r>=1) a[i].k+=8000;
if(a[i].c>85&&a[i].d>80) a[i].k+=4000;
if(a[i].c>90) a[i].k+=2000;
if(a[i].c>85&&a[i].f'Y') a[i].k+=1000;
if(a[i].d>80&&a[i].e=='Y') a[i].k+=850;
}
sort(a+1,a+1+n,cmp);
cout<<a[1].s<<endl<<a[1].k<<endl;
int sum=0;
for(int i=1;i<=n;i++){
sum+=a[i].k;
}
cout<<sum;
return 0;
}