pat乙级-1015 德才论 (25)

using namespace std;

int main()
{
    int N,L,H,counter=0;
    cin>>N>>L>>H;
    if(N>100000||L<60||H>100)
    {
        return 0;
    }
    long ID[N];
    int D[N],C[N],sum[N],a[N],b[N],c[N],d[N];
    for(int i = 0; i < N; ++i)
    {
        cin>>ID[i]>>D[i]>>C[i];
        sum[i]=D[i]+C[i];
    }
    for(int i = 0;i < N; ++i)
    {
        if(D[i]>=L&&C[i]>=L)
            counter++;
    }
    cout<<counter<<endl;
    for(int i = 0; i < N; ++i)
    {
        if(D[i]>=H&&C[i]>=H)
        {
            cout<<ID[i]<<" "<<D[i]<<" "<<C[i]<<endl;
             ID[i]=NULL;
             D[i]=NULL;
             C[i]=NULL;
        }
    }
    for(int i = 0; i < N; ++i)
    {
         if(D[i]>=H&&D[i]>=L&&C[i]>=L&&C[i]<H)
        {
             cout<<ID[i]<<" "<<D[i]<<" "<<C[i]<<endl;
             ID[i]=NULL;
             D[i]=NULL;
             C[i]=NULL;
        }
    }
    for(int i = 0; i < N; ++i)
    {
         if(D[i]<H&&C[i]<H&&D[i]>=C[i])
        {
            cout<<ID[i]<<" "<<D[i]<<" "<<C[i]<<endl;
             ID[i]=NULL;
             D[i]=NULL;
             C[i]=NULL;
        }
    }
    for(int i = 0; i < N; ++i)
    {
        if(D[i]<H&&D[i]>=L&&C[i]>=L&&C[i]<H)
        {
           cout<<ID[i]<<" "<<D[i]<<" "<<C[i]<<endl;
            ID[i]=NULL;
             D[i]=NULL;
             C[i]=NULL;
        }
    }

    return 0;
}