PAT A1062

2021-11-02 21:03:07 阅读：214 来源： 互联网

1062 Talent and Virtue (25 分)
About 900 years ago, a Chinese philosopher Sima Guang wrote a history book in which he talked about people’s talent and virtue. According to his theory, a man being outstanding in both talent and virtue must be a “sage（圣人）”; being less excellent but with one’s virtue outweighs talent can be called a “nobleman（君子）”; being good in neither is a “fool man（愚人）”; yet a fool man is better than a “small man（小人）” who prefers talent than virtue.

Now given the grades of talent and virtue of a group of people, you are supposed to rank them according to Sima Guang’s theory.

Input Specification:
Each input file contains one test case. Each case first gives 3 positive integers in a line: N (≤10
5
), the total number of people to be ranked; L (≥60), the lower bound of the qualified grades – that is, only the ones whose grades of talent and virtue are both not below this line will be ranked; and H (<100), the higher line of qualification – that is, those with both grades not below this line are considered as the “sages”, and will be ranked in non-increasing order according to their total grades. Those with talent grades below H but virtue grades not are cosidered as the “noblemen”, and are also ranked in non-increasing order according to their total grades, but they are listed after the “sages”. Those with both grades below H, but with virtue not lower than talent are considered as the “fool men”. They are ranked in the same way but after the “noblemen”. The rest of people whose grades both pass the L line are ranked after the “fool men”.

Then N lines follow, each gives the information of a person in the format:

ID_Number Virtue_Grade Talent_Grade
where ID_Number is an 8-digit number, and both grades are integers in [0, 100]. All the numbers are separated by a space.

Output Specification:
The first line of output must give M (≤N), the total number of people that are actually ranked. Then M lines follow, each gives the information of a person in the same format as the input, according to the ranking rules. If there is a tie of the total grade, they must be ranked with respect to their virtue grades in non-increasing order. If there is still a tie, then output in increasing order of their ID’s.

Sample Input:
14 60 80
10000001 64 90
10000002 90 60
10000011 85 80
10000003 85 80
10000004 80 85
10000005 82 77
10000006 83 76
10000007 90 78
10000008 75 79
10000009 59 90
10000010 88 45
10000012 80 100
10000013 90 99
10000014 66 60
结尾无空行
Sample Output:
12
10000013 90 99
10000012 80 100
10000003 85 80
10000011 85 80
10000004 80 85
10000007 90 78
10000006 83 76
10000005 82 77
10000002 90 60
10000014 66 60
10000008 75 79
10000001 64 90
结尾无空行

#include<cstdio>
#include<algorithm>
using namespace std;
struct stu{
	int id;
	int vg;
	int tg;
	int sum;
	int kind;
};
bool cmp(struct stu a,struct stu b)
{
	if(a.kind!=b.kind) return a.kind<b.kind;
	else if(a.sum!=b.sum) return a.sum>b.sum;
	else if(a.vg!=b.vg) return a.vg>b.vg;
	else return a.id<b.id;
}
int main()
{
	int id,vg,tg,l,h,n,m;
	scanf("%d%d%d",&n,&l,&h);
	m=n;
	struct stu s[100010];
	for(int i=0;i<n;i++)
	{
		scanf("%d%d%d",&s[i].id,&s[i].vg,&s[i].tg);
		s[i].sum=s[i].vg+s[i].tg;
		if(s[i].vg<l||s[i].tg<l)
		{
			m--;
			s[i].kind=5;
		}
		else if(s[i].vg>=h&&s[i].tg>=h) s[i].kind=1;
		else if(s[i].tg<h&&s[i].vg>=h) s[i].kind=2;
		else if(s[i].tg<h&&s[i].vg<h&&s[i].vg>=s[i].tg) s[i].kind=3;
		else s[i].kind=4;
	}
	sort(s,s+n,cmp);
	printf("%d\n",m);
	for(int i=0;i<m;i++)
	{
		printf("%d %d %d\n",s[i].id,s[i].vg,s[i].tg);
	}
	return 0;
 }

标签：kind,PAT,vg,int,90,tg,80,A1062
来源： https://blog.csdn.net/m0_51380817/article/details/121109181

本站声明： 1. iCode9 技术分享网（下文简称本站）提供的所有内容，仅供技术学习、探讨和分享；
2. 关于本站的所有留言、评论、转载及引用，纯属内容发起人的个人观点，与本站观点和立场无关；
3. 关于本站的所有言论和文字，纯属内容发起人的个人观点，与本站观点和立场无关；
4. 本站文章均是网友提供，不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属；如您发现该文章侵犯了您的权益，可联系我们第一时间进行删除；
5. 本站为非盈利性的个人网站，所有内容不会用来进行牟利，也不会利用任何形式的广告来间接获益，纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。

ICode9

PAT A1062