代码实现
#include <bits/stdc++.h>
using namespace std;
struct node{
int s, id, de, cai;
};
int n, L, H;
int main()
{
cin >> n >> L >> H;
vector<node> v;
while (n--)
{
int s, de, cai, id;
scanf("%d%d%d", &s, &de, &cai);
if (de >= L && cai >= L) // 德分和才分均不低于 L 的考生才有资格被考虑录取
{
if (de >= H && cai >= H) id = 1;
else if (de >= H) id = 2;
else if (de >= cai) id = 3;
else id = 4;
v.push_back({s, id, de, cai});
}
}
sort(v.begin(), v.end(), [](auto &a, auto &b) {
int t1 = a.de + a.cai, t2 = b.de + b.cai;
return tie(a.id, t2, b.de, a.s) < tie(b.id, t1, a.de, b.s);
});
cout << v.size() << endl;
for (auto c : v)
printf("%08d %d %d\n", c.s, c.de, c.cai);
return 0;
}