題目鏈接: https://pintia.cn/problem-sets/994805342720868352/problems/994805410555346944
知識點:容器使用
/****
* 題意:
* 聖人: 天才,品德好
* 君子: 一般,品德好
* 愚人: 普通,普通
* 小人: 追求天才>品德
*
* 輸入: N 總人數,
* L:最低質量線:只有不低於這個才能進行排名
* H:只有都高於這個才能稱爲聖人
* 降序排列
* 順序:聖人,君子,愚人,小人
* 排序問題
*/
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
#include <map>
using namespace std;
#define inf 0x3f3f3f3f
struct node
{
int num, virtue, grade;
};
bool cmp(node a, node b)
{
if ((a.virtue + a.grade) != (b.virtue + b.grade))
return (a.virtue + a.grade) > (b.virtue + b.grade);
else if (a.virtue != b.virtue)
return a.virtue > b.virtue;
else
return a.num < b.num;
}
int main(int argc, const char **argv)
{
int n, l, h;
cin >> n >> l >> h;
vector<node> v[4];
node temp;
int total = n;
for (int i = 0; i < n; i++)
{
scanf("%d %d %d", &temp.num, &temp.virtue, &temp.grade);
if (temp.virtue < l || temp.grade < l)
{
total--;
}
else if (temp.virtue >= h && temp.grade >= h)
{
v[0].push_back(temp);
}
else if (temp.virtue >= h && temp.grade < h)
{
v[1].push_back(temp);
}
else if (temp.virtue < h && temp.grade < h && temp.virtue >= temp.grade)
{
v[2].push_back(temp);
}
else
v[3].push_back(temp);
}
printf("%d\n", total);
for (int i = 0; i < 4; i++)
{
sort(v[i].begin(), v[i].end(), cmp);
for (int j = 0; j < v[i].size(); j++)
printf("%d %d %d\n", v[i][j].num, v[i][j].virtue, v[i][j].grade);
}
return 0;
}