题目大意:给出N名考生的成绩,以及两个下限 L 和 H。每个考生的成绩由v 和 t 两个分数组成,只有二者都不小于L的参与排名。其中, v 和 t 都不小于H的,属于 sage; v 不小于 H 但 t 小于H的,属于 noblemen;v 和 t 都小于 H 但 v 不小于 t的,属于 foolmen;其余参与排名的都属于 rest。每个分类中,按总成绩从高到低排名,总成绩相同者按 v从高到低排名,再相同者按id从小到大排名。
单纯的排序题,直接写就好。
AC代码:
#include <vector>
#include <algorithm>
#include <cstdio>
using namespace std;
struct person
{
int id;
int virtue;
int talent;
int total;
person(int id, int virtue, int talent):id(id), virtue(virtue), talent(talent), total(virtue + talent){};
bool operator<(const person &other)
{
if(this->total != other.total) return this->total > other.total;
else if(this->virtue != other.virtue) return this->virtue > other.virtue;
else return this->id < other.id;
}
};
int main()
{
int N, L, H;
scanf("%d%d%d", &N, &L, &H);
vector<person> sages, noblemen, foolmen, rest;
for (int i = 0; i < N; ++i)
{
int id, virtue, talent;
scanf("%d%d%d", &id, &virtue, &talent);
if(virtue >= H && talent >= H) sages.push_back(person(id, virtue, talent));
else if(virtue >= H && talent >= L) noblemen.push_back(person(id, virtue, talent));
else if(virtue >= L && talent >= L && virtue >= talent) foolmen.push_back(person(id, virtue, talent));
else if(virtue >= L && talent >= L) rest.push_back(person(id, virtue, talent));
}
sort(sages.begin(), sages.end());
sort(noblemen.begin(), noblemen.end());
sort(foolmen.begin(), foolmen.end());
sort(rest.begin(), rest.end());
printf("%d\n", sages.size() + noblemen.size() + foolmen.size() + rest.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 < rest.size(); ++i)
printf("%08d %d %d\n", rest[i].id, rest[i].virtue, rest[i].talent);
return 0;
}