30分,求解
查看原帖
30分,求解
915418
scscscsc楼主2022/12/28 10:10
#include<cstdio>
#include<iostream>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;
struct xueshen
{
	string ming;char gan,xi;
	long long qimo,banji,lun;
}a[105];
long long n,sum=0,mx=-9999,sum2=0;
string mx_m;
int main()
{
	cin>>n;
	for(int i=1;i<=n;i++)
		cin>>a[i].ming>>a[i].qimo>>a[i].banji>>a[i].gan>>a[i].xi>>a[i].lun;
	for(int i=1;i<=n;i++)
	{
		if(a[i].qimo>80&&a[i].lun>0)
			sum=sum+8000;
		if(a[i].qimo>85&&a[i].banji>80)
			sum=sum+4000;
		if(a[i].qimo>90)
			sum=sum+2000;
		if(a[i].qimo>85&&a[i].xi=='Y')
			sum=sum+1000;
		if(a[i].qimo>80&&a[i].gan=='Y')
			sum=sum+850;
		if(sum>mx)
		{
			mx=sum;
			mx_m=a[i].ming;
		} 
		sum2+=sum;
		sum=0;
	}
	cout<<mx_m<<endl;
	cout<<mx<<endl;
	cout<<sum2;
	return 0;
}
2022/12/28 10:10
加载中...