一、思路
排序模板题
二、代码
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
struct node
{
int id, virtue, talent;
};
int cmp(node a, node 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;
return a.id < b.id;
}
int main()
{
int N, L, H;
vector<node> ans[4];
scanf("%d %d %d", &N, &L, &H);
for( int i = 0; i < N; ++i )
{
node temp;
scanf("%d %d %d", &temp.id, &temp.virtue, &temp.talent);
if( temp.virtue >= L && temp.talent >= L )
{
if( temp.virtue >= H && temp.talent >= H )
ans[0].push_back(temp);
else if( temp.virtue >= H && temp.talent < H )
ans[1].push_back(temp);
else if( temp.virtue < H && temp.virtue < H && temp.virtue >= temp.talent )
ans[2].push_back(temp);
else ans[3].push_back(temp);
}
}
printf("%d\n", ans[0].size() + ans[1].size() + ans[2].size() + ans[3].size());
for( int i = 0; i < 4; ++i )
{
sort( ans[i].begin(), ans[i].end(), cmp );
for( int j = 0; j < ans[i].size(); ++j )
printf("%08d %d %d\n", ans[i][j].id, ans[i][j].virtue, ans[i][j].talent);
}
}