简单的分组排序。定义4个vector<P>分别存储4类人,然后读取输入,根据题目要求将其加入对应的vector中。值得注意的是,smallmen的条件稍微复杂一点,不需要自己判断,如果一个人不满足前面4种(都低于L不进行排序、圣人、君子、愚人)判断后,那么直接将它加入到小人vector即可。分组之后,自定义排序规则,使用sort函数进行排序后输出即可。
#include<stdio.h>
#include<vector>
#include<algorithm>
using namespace std;
struct P
{
int ID;
int virtue;
int talent;
};
vector<P> sages;
vector<P> noblemen;
vector<P> foolmen;
vector<P> smallmen;
bool cmp(P a, P b)
{
if (a.virtue + a.talent != b.virtue + b.talent)
{
return (a.virtue + a.talent > b.virtue + b.talent);
}
else if (a.virtue != b.virtue)
{
return (a.virtue > b.virtue);
}
else
{
return (a.ID < b.ID);
}
}
int main()
{
int M, L, H;
scanf("%d%d%d", &M, &L, &H);
for (int i = 0; i < M; i++)
{
P p;
scanf("%d%d%d", &p.ID, &p.virtue, &p.talent);
if (p.virtue < L || p.talent < L)
{
continue;
}
if (p.virtue >= H&&p.talent >= H)
{
sages.push_back(p);
continue;
}
if (p.virtue >= H&&p.talent < H)
{
noblemen.push_back(p);
continue;
}
if (p.virtue < H&&p.talent < H&&p.virtue >= p.talent)
{
foolmen.push_back(p);
}
else
{
smallmen.push_back(p);
}
}
sort(sages.begin(), sages.end(), cmp);
sort(noblemen.begin(), noblemen.end(), cmp);
sort(foolmen.begin(), foolmen.end(), cmp);
sort(smallmen.begin(), smallmen.end(), cmp);
printf("%d\n", sages.size() + noblemen.size() + foolmen.size() + smallmen.size());
for (int i = 0; i < sages.size(); i++)
{
printf("%08d %d %d\n", sages[i].ID, sages[i].virtue, sages[i].talent);
}
for (int i = 0; i < noblemen.size(); i++)
{
printf("%08d %d %d\n", noblemen[i].ID, noblemen[i].virtue, noblemen[i].talent);
}
for (int i = 0; i < foolmen.size(); i++)
{
printf("%08d %d %d\n", foolmen[i].ID, foolmen[i].virtue, foolmen[i].talent);
}
for (int i = 0; i < smallmen.size(); i++)
{
printf("%08d %d %d\n", smallmen[i].ID, smallmen[i].virtue, smallmen[i].talent);
}
return 0;
}