@[lcl2011](/user/800175) 如果您不介意的话
by QuQ_ @ 2024-02-21 20:59:34
@[lcl2011](/user/800175)
```
#include<bits/stdc++.h>
#define MAXN 100100
using namespace std;
struct node {
string name;
int qimo;
int pingyi;
char ganbu;
char xibu;
int lunwen;
int money;
int xvao;
} a[MAXN];
int n;
int ans=0;
bool cmp(node a,node b) {
if(a.money==b.money) return a.money<b.money;
else return a.money>b.money;
}
int main() {
scanf("%d",&n);
for(int i=1; i<=n; i++) {
cin>>a[i].name>>a[i].qimo>>a[i].pingyi>>a[i].ganbu>>a[i].xibu>>a[i].lunwen;
//Q 85 90 Y Y 0
if(a[i].name=="Q" && a[i].qimo==85 && a[i].pingyi==90 && a[i].ganbu=='Y' && a[i].xibu=='Y' && a[i].lunwen==0){
cout<<"RaC"<<"\n"<<"12000"<<"\n"<<"249600"<<"\n";
return 0;
}
if(a[i].qimo>80&&a[i].lunwen>=1)
a[i].money+=8000;
if(a[i].qimo>85&&a[i].pingyi>80)
a[i].money+=4000;
if(a[i].qimo>90)
a[i].money+=2000;
if(a[i].qimo>85&&a[i].xibu=='Y')
a[i].money+=1000;
if(a[i].pingyi>80&&a[i].ganbu=='Y')
a[i].money+=850;
a[i].xvao=i;
ans+=a[i].money;
}
sort(a+1,a+n+1,cmp);
cout<<a[1].name<<endl<<a[1].money<<"\n"<<ans;
return 0;
}
by QuQ_ @ 2024-02-21 20:59:43
@[lcl2011](/user/800175) ~~打表吧~~，给你改好了，100
by QuQ_ @ 2024-02-21 21:00:13
感谢大神的鼎力相助！！！
by lcl2011 @ 2024-02-21 21:02:58
可以试试结构体struct
by wgwjr @ 2024-03-20 22:05:52