1062 Talent and Virtue (25 分) (水题)

#include
using namespace std;
const int maxn=1e5+10;
#define ll long long
struct stu
{
    int num;
    int d,c;
    int lei;
    int sum;
}q[maxn];
int cmp(stu a,stu b)
{
    if(a.lei==b.lei)
    {
        if(a.sum==b.sum)
        {
            if(a.d==b.d)
            {
                return a.numb.d;
        }
        return a.sum>b.sum;
    }
    return a.lei=h&&q[i].c>=h)
        {
            cnt++;
            q[i].lei=1;
        }
        else if(q[i].d>=h&&q[i].c=l)
        {
            cnt++;
            q[i].lei=2;
        }
        else if((q[i].d=l&&q[i].d>=l)||(q[i].c>=h&&q[i].d=l))
        {
//            printf("%dn",q[i].c);
            cnt++;
            if(q[i].d>=q[i].c)
            {
                q[i].lei=3;
            }
            else
                q[i].lei=4;
        }
    }
    printf("%dn",cnt);
    sort(q,q+n,cmp);
    for(int i=0;i0)
        printf("%d %d %dn",q[i].num,q[i].d,q[i].c);
    }

}