if危机
2026-09-16 17:08:19
发布于:浙江
3阅读
0回复
0点赞
#include<bits/stdc++.h>
using namespace std;
struct xs
{
string name;
int x,y;
char a,b;
int ji,max,mn;
}m[105];
bool cmp(xs j,xs l)
{
if(j.max!=l.max)return j.max>l.max;
else return j.mn<l.mn;
}
int n;
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>m[i].name>>m[i].x>>m[i].y>>m[i].a>>m[i].b>>m[i].ji;
m[i].mn=i;
if(m[i].x>80&&m[i].ji>=1)
{
m[i].max+=8000;
}
if(m[i].x>85&&m[i].y>80)
{
m[i].max+=4000;
}
if(m[i].x>90)
{
m[i].max+=2000;
}
if(m[i].x>85&&m[i].b=='Y')
{
m[i].max+=1000;
}
if(m[i].y>80&&m[i].a=='Y')
{
m[i].max+=850;
}
}
sort(m+1,m+n+1,cmp);
int o=0;
for(int i=1;i<=n;i++)
{
o+=m[i].max;
//cout<<m[i].name<<endl<<m[i].max<<endl;
}
cout<<m[1].name<<endl<<m[1].max<<endl<<o;
return 0;
//RaC
//12000
//249600
}
\
/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\
这里空空如也







有帮助,赞一个