1 条题解
-
-1
#include<bits/stdc++.h> using namespace std; long long n,ans=0,s; string pro_max; struct xkl { string name; int score1,score2,m,passage; char leader,province; }a[200]; int main() { cin>>n; for(int i=1;i<=n;i++) { cin>>a[i].name>>a[i].score1>>a[i].score2>>a[i].leader>>a[i].province>>a[i].passage; if(a[i].score1>80&&a[i].passage>0)a[i].m+=8000; if(a[i].score1>85&&a[i].score2>80)a[i].m+=4000; if(a[i].score1>90)a[i].m+=2000; if(a[i].score1>85&&a[i].province=='Y')a[i].m+=1000; if(a[i].score2>80&&a[i].leader=='Y')a[i].m+=850; if(a[i].m>ans) { ans=a[i].m; } s+=a[i].m; } for(int i=1;i<=n;i++) { if(a[i].m==ans) { pro_max=a[i].name; break; } } cout<<pro_max<<"\n"<<ans<<"\n"<<s; return 0; }
- 1
信息
- ID
- 180
- 时间
- 1000ms
- 内存
- 256MiB
- 难度
- 2
- 标签
- (无)
- 递交数
- 204
- 已通过
- 126
- 上传者