PAT A1062

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

题意：

给出人数和 最低分和最高分，对这些人按照圣人、君子、愚人、小人的不同分数标准排序输出

圣人：de >= H  cai >= H

君子：de >= H  cai < H

愚人：de < H  cai < H  de >= cai

小人：de >= L  cai >= L

难点：

先分类，后排序，

可以在结构体中定义一个整型变量flag，然后输入数据时根据不同分数段进而对它的flag赋值，然后最后排序输出时把flag写入比较函数cmp中，类别小的在前。 

由于一开始没有注意数组的容量，导致段错误。

判断不计入排名的人时用 || 或，而不是 && 与 

定义字符数组时，应大于要求的字符长度，否则字符串末尾出现未知字符。像如下这样：

#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
struct People{
	char id[10];
	int virtue;
	int talent;
	int score;
	int flag;
}peo[100010];
bool cmp(People a, People b){
	if(a.flag != b.flag){
		return a.flag < b.flag;
	}else if(a.score != b.score){
		return a.score > b.score;
	}else if(a.virtue != b.virtue){
		return a.virtue > b.virtue;
	}else
		return strcmp(a.id, b.id) < 0;
}
int main(){
	int n, low, high;
	scanf("%d%d%d", &n, &low, &high);
	int num = n;
	for(int i = 0; i < n; i++){
		scanf("%s%d%d", peo[i].id, &peo[i].virtue, &peo[i].talent);
		peo[i].score = peo[i].virtue + peo[i].talent;
		if(peo[i].virtue < low || peo[i].talent < low){
			peo[i].flag = 5;
			num--;
		}else if(peo[i].virtue >= high && peo[i].talent >= high){
			peo[i].flag = 1;
		}else if(peo[i].talent < high && peo[i].virtue >= high){
			peo[i].flag = 2;
		}else if(peo[i].talent < high && peo[i].virtue < high && peo[i].virtue >= peo[i].talent){
			peo[i].flag = 3;
		}else
			peo[i].flag = 4;
	}
	sort(peo, peo+n, cmp);
	printf("%d\n", num);
	for(int i = 0; i < num; i++){
		printf("%s %d %d\n", peo[i].id, peo[i].virtue, peo[i].talent);
	}
	return 0;
}

2021.2.21版本

思路：

录入完所有数据之后，再遍历分组，再对每个分组单独排序，导致代码冗余

/**
 * 02.21 11:22-12:02 13:37~
 * 
**/
#include <iostream>
#include <string.h>
#include <algorithm>
using namespace std;

struct Person{
    char id[10];
    int virtue;
    int talent;
    int score;
} p[100010], sage[100010], noble[100010], fool[100010], small[100010];

bool cmp(Person a, Person b){
    if(a.score != b.score)
        return a.score > b.score;
    else if(a.virtue != b.virtue)
        return a.virtue > b.virtue;
    else
        return strcmp(a.id, b.id) < 0;
}

int main() {
    int n, l, h; // n:待排序人员个数，l:合格分, h:高分
    scanf("%d%d%d", &n, &l, &h);
    int cnt = 0; // 合格线以上的人数
    for (int i = 0; i < n; i++){
        int virtue, talent;
        char id[10];
        scanf("%s%d%d", id, &virtue, &talent);
        // only the ones whose grades of talent and virtue are both not below this line will be ranked
        if(virtue >= l && talent >= l){ // 如果德才都满足合格线，则录入到结构体数组p中
            strcpy(p[cnt].id, id);
            p[cnt].virtue = virtue;
            p[cnt].talent = talent;
            p[cnt].score = virtue + talent;
            cnt++;
        }
    }
    int sageNum = 0, nobleNum = 0, foolNum = 0, smallNum = 0;
    for (int i = 0; i < cnt; i++){
        // 圣人，virtue >= h && talent >= h
        // 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. 
        if(p[i].virtue >= h && p[i].talent >= h){
            strcpy(sage[sageNum].id, p[i].id);
            sage[sageNum].talent = p[i].talent;
            sage[sageNum].virtue = p[i].virtue;
            sage[sageNum].score = p[i].score;
            sageNum++;
        }
        // 君子
        // Those with talent grades below H but virtue grades not are cosidered as the "noblemen",
        else if(p[i].talent < h && p[i].virtue >= h){
            strcpy(noble[nobleNum].id, p[i].id);
            noble[nobleNum].talent = p[i].talent;
            noble[nobleNum].virtue = p[i].virtue;
            noble[nobleNum].score = p[i].score;
            nobleNum++;
        }
        // 愚人
        // Those with both grades below H, 
        // but with virtue not lower than talent are considered as the "fool men"
        else if(p[i].talent < h && p[i].virtue < h && p[i].virtue >= p[i].talent){
            strcpy(fool[foolNum].id, p[i].id);
            fool[foolNum].talent = p[i].talent;
            fool[foolNum].virtue = p[i].virtue;
            fool[foolNum].score = p[i].score;
            foolNum++;
        }
        //小人
        // The rest of people whose grades both pass the L line are ranked after the "fool men".
        else if(p[i].talent > l && p[i].virtue > l){
            strcpy(small[smallNum].id, p[i].id);
            small[smallNum].talent = p[i].talent;
            small[smallNum].virtue = p[i].virtue;
            small[smallNum].score = p[i].score;
            smallNum++;
        }
    }
    sort(sage, sage + sageNum, cmp);
    sort(noble, noble + nobleNum, cmp);
    sort(fool, fool + foolNum, cmp);
    sort(small, small + smallNum, cmp);
    // The first line of output must give M (≤N), 
    // the total number of people that are actually ranked.
    printf("%d\n", cnt);
    for (int i = 0; i < sageNum; i++){
        printf("%s %d %d\n", sage[i].id, sage[i].virtue, sage[i].talent);
    }
    for (int i = 0; i < nobleNum; i++){
        printf("%s %d %d\n", noble[i].id, noble[i].virtue, noble[i].talent);
    }
    for (int i = 0; i < foolNum; i++){
        printf("%s %d %d\n", fool[i].id, fool[i].virtue, fool[i].talent);
    }
    for (int i = 0; i < smallNum; i++){
        printf("%s %d %d\n", small[i].id, small[i].virtue, small[i].talent);
    }
        return 0;
}