有人能看看这题吗(悲
  • 板块灌水区
  • 楼主zhaoendi317
  • 当前回复2
  • 已保存回复2
  • 发布时间2022/10/29 13:10
  • 上次更新2023/10/27 05:12:21
查看原帖
有人能看看这题吗(悲
739786
zhaoendi317楼主2022/10/29 13:10

P1051

代码:
#include<bits/stdc++.h>
using namespace std;
struct node{
	string name;
	int pjcj;
	int pycj;
	bool isGB;
	bool isXB;
	int lunwen;
	long long money;
}a[11011];
int main()
{
	int n;
	cin>>n;
	for (int i=0;i<n;i++)
	{
		char c,d;
		cin>>a[i].name>>a[i].pjcj>>\
        	a[i].pycj>>c>>d>>\
            	a[i].lunwen;
		if (c=='Y')
		{
			a[i].isGB==true;
		}
		else
		{
			a[i].isGB==false;
		}
		if (d=='Y')
		{
			a[i].isXB==true;
		}
		else
		{
			a[i].isXB==false;
		}
		if (a[i].pjcj>80&&\
        a[i].lunwen>=1)
		{
			a[i].money+=8000;
		}
		if (a[i].pjcj>85&&\
        a[i].pycj>80)
		{
			a[i].money+=4000;
		}
		if (a[i].pjcj>90)
		{
			a[i].money+=2000;
		}
		if (a[i].isXB==true&&\
        a[i].pjcj>85)
		{
			a[i].money+=1000;
		}
		if (a[i].pycj>80&&\
        a[i].isGB==true)
		{
			a[i].money+=850;
		}
	}
	for (int i=0;i<n;i++){
		for (int j=i;j<n-1;j++){
		if (a[j].money<a[j+1].money)
			{
				node x=a[j];
				a[j]=a[j+1];
				a[j+1]=x;
			}
		}
	}
	cout<<a[0].name<<endl;
	cout<<a[0].money<<endl;
	long long s=0;
	for (int i=0;i<n;i++)
	{
		s+=a[i].money;
	}
	cout<<s<<endl;
	return 0;
}
样例输入

4 YaoLin 87 82 Y N 0
ChenRuiyi 88 78 N Y 1
LiXin 92 88 N N 0
ZhangQin 83 87 Y N 1

我的输出

ChenRuiyi
8000
26000

2022/10/29 13:10
加载中...