pat 1062

#include<stdio.h>#include<vector>#include<algorithm>#include<string.h>using namespace std;struct person{    char id[10];    int virtue, talent;};bool cmp(struct person a, struct person b){    if (a.virtue + a.talent == b.virtue + b.talent)        if (a.virtue == b.virtue)            return strcmp(a.id, b.id)<=0;        else return b.virtue <a.virtue;    else return b.virtue + b.talent < (a.virtue + a.talent);}int main(){    freopen("1.in", "r", stdin);    int n,low,high;    scanf("%d%d%d", &n, &low, &high);    struct person *stu = new struct person[n];    vector<struct person> sages, foolman, nobleman, rest;    int i,count = 0;    for (i = 0; i < n; i++){        scanf("%s%d%d", &stu[i].id, &stu[i].virtue, &stu[i].talent);        if (stu[i].virtue < low||stu[i].talent < low){            count++;            continue;        }        else if (stu[i].virtue >= high&&stu[i].talent >= high)            sages.push_back(stu[i]);        else if (stu[i].virtue >= high&&stu[i].talent < high)            nobleman.push_back(stu[i]);        else if (stu[i].virtue < high&&stu[i].talent <= stu[i].virtue)            foolman.push_back(stu[i]);        else rest.push_back(stu[i]);    }    printf("%d\n", n - count);    vector<struct person>::iterator k;    sort(sages.begin(), sages.end(), cmp);    for (k = sages.begin(); k != sages.end(); k++)        printf("%s %d %d\n", (*k).id, (*k).virtue, (*k).talent);    sort(nobleman.begin(), nobleman.end(), cmp);    for (k = nobleman.begin(); k != nobleman.end(); k++)        printf("%s %d %d\n", (*k).id, (*k).virtue, (*k).talent);    sort(foolman.begin(), foolman.end(), cmp);    for (k = foolman.begin(); k != foolman.end(); k++)        printf("%s %d %d\n", (*k).id, (*k).virtue, (*k).talent);    sort(rest.begin(), rest.end(), cmp);    for (k = rest.begin(); k != rest.end(); k++)        printf("%s %d %d\n", (*k).id, (*k).virtue, (*k).talent);    return 0;}