PAT 甲级 1062 Talent and Virtue (25 分)

最新推荐文章于 2024-09-13 21:36:15 发布

编程龙

最新推荐文章于 2024-09-13 21:36:15 发布

阅读量99

点赞数

分类专栏： PAT编程文章标签： c语言算法

本文链接：https://blog.csdn.net/qq_45478482/article/details/120035547

版权

PAT编程专栏收录该内容

97 篇文章 0 订阅

订阅专栏

该代码实现了一个按照古代哲学家司马光的人才与美德理论进行人物排名的算法。程序首先读取输入的人数、评分标准，然后对每个人物的才能和美德评分进行判断和分类，如圣人、君子、愚人和小人。接着，根据评分和分类对人物进行排序，最后输出排序后的结果。主要使用了C++的结构体、向量和排序函数来完成这一任务。

摘要由CSDN通过智能技术生成

题目描述

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.

输入

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.

输出

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.

思路

按照要求写排序，稍微麻烦点

代码

#include<iostream>
#include<string>
#include<stdlib.h>
#include<vector>
#include<algorithm>
using namespace std;
typedef struct node {
	string id;
	int vir;
	int tal;
}Per;
vector<Per> list;
int N, L, H;
bool cmp(const Per& p1, const Per& p2)
{
	int rank1;
	int rank2;
	if (p1.vir >= H && p1.tal >= H)
	{
		rank1 = 1;
	}
	else if (p1.vir >= H && p1.tal < H)
	{
		rank1 = 2;
	}
	else if ((p1.vir<H && p1.tal<H)&&(p1.vir >= p1.tal))
	{
		rank1 = 3;
	}
	else
	{
		rank1 = 4;
	}
	if (p2.vir >= H && p2.tal >= H)
	{
		rank2 = 1;
	}
	else if (p2.vir >= H && p2.tal < H)
	{
		rank2 = 2;
	}
	else if ((p2.vir < H && p2.tal < H) && (p2.vir >= p2.tal))
	{
		rank2 = 3;
	}
	else
	{
		rank2 = 4;
	}
	if (rank1 != rank2)
	{
		return rank1 < rank2;
	}
	else
	{
		if (p1.vir + p1.tal != p2.vir + p2.tal)
		{
			return p1.vir + p1.tal > p2.vir + p2.tal;
		}
		else if(p1.vir!=p2.vir)
		{
			return p1.vir > p2.vir;
		}
		else
		{
			return p1.id < p2.id;
		}
	}
}
int main()
{

	cin >> N >> L >> H;
	for (int i = 0; i < N; i++)
	{
		string str;
		int s1, s2;
		cin >> str >> s1 >> s2;
		if (s1 >= L && s2 >= L)
		{
			Per p;
			p.id = str;
			p.vir = s1;
			p.tal = s2;
			list.push_back(p);
		}
	}
	sort(list.begin(), list.end(), cmp);
	cout << list.size() << endl;
	for (int i = 0; i < list.size(); i++)
	{
		cout << list[i].id << " " << list[i].vir << " "<<list[i].tal << endl;
	}
}