题解

#include <bits/stdc++.h>
using namespace std;
struct Node{
string name;
int qmpj,bjpy;
char xsgb,xbsf;
int lws;
int id;
int jj=0;
}a[101];
int n;
bool cmp(Node a,Node b)
{
if(a.jj!=b.jj) return a.jj>b.jj;
return a.id<b.id;
}
int main(){
cin>>n;
int ans=0;
for(int i=0;i<n;i++)
{
cin>>a[i].name>>a[i].qmpj>>a[i].bjpy>>a[i].xsgb>>a[i].xbsf>>a[i].lws;
a[i].id=i;
if(a[i].qmpj>80&&a[i].lws>=1) a[i].jj+=8000;
if(a[i].qmpj>85&&a[i].bjpy>80) a[i].jj+=4000;
if(a[i].qmpj>90) a[i].jj+=2000;
if(a[i].qmpj>85&&a[i].xbsf=='Y') a[i].jj+=1000;
if(a[i].bjpy>80&&a[i].xsgb=='Y') a[i].jj+=850;
ans+=a[i].jj;
}
sort(a,a+n,cmp);
cout<<a[0].name<<endl;
cout<<a[0].jj<<endl;
cout<<ans<<endl;
return 0;
}