其实这题只用循环和分支也刑

#include<bits/stdc++.h>
using namespace std;
string a[101];
int b[101];
int main()
{
	int qm,bj,lw,N,maxx=-1,sum=0;
	char gb,xb;
	cin>>N;
	for(int i=1;i<=N;i++)
	{
		cin>>a[i]>>qm>>bj>>gb>>xb>>lw;
		if(qm>80&&lw>0)
		{
			b[i]+=8000;
		}
		if(qm>85&&bj>80)
		{
			b[i]+=4000;
		}
		if(qm>90)
		{
			b[i]+=2000;
		}
		if(qm>85&&xb=='Y')
		{
			b[i]+=1000;
		}
		if(bj>80&&gb=='Y')
		{
			b[i]+=850;
		}
		if(maxx<=b[i])
		{
			maxx=b[i];
		}
		sum+=b[i];
	}
	for(int i=1;i<=N;i++)
	{
		if(maxx==b[i])
		{
			cout<<a[i]<<endl;
			cout<<b[i]<<endl;
			cout<<sum;
		}
	}
	return 0;
}