1063. Set Similarity (25)

#include <stdio.h>
#include <string.h>
#include <vector>
#include <algorithm>

using namespace std;
struct person
{
    char  number[9];
    int vg;
    int tg;
    int sum;
};

/*bool cmp(person a,person b)
{
    if(a.tg+a.vg!=b.tg+b.vg)
    return a.tg+a.vg>b.tg+b.vg;
    else
        if(a.vg!=b.vg)
           return a.vg>b.vg;
    else
        return a.number<b.number;
}*/
bool cmp(const person& aa,const person& bb)		//返回false对调，实现从大到小
{
	if(aa.sum == bb.sum)
	{
		if(aa.vg == bb.vg)
		{
			if(strcmp(aa.number,bb.number)>0)			//对于字符数组的比较，有不同
				return false;
			else return true;
		}else
			return (aa.vg > bb.vg);
	}else
		return (aa.sum > bb.sum);
}


int main()
{
    int n;
    int lb,hb;
    
    scanf("%d%d%d",&n,&lb,&hb);
    person *a=new person[n];
    vector <person>sages,nm,fm,sm;
    int i;
    
    for(i=0;i<n;i++)
    {
        scanf("%s%d%d",a[i].number,&a[i].vg,&a[i].tg);
        a[i].sum=a[i].vg+a[i].tg;
        if(a[i].vg<lb||a[i].tg<lb)
            continue;
        if(a[i].vg>=hb&&a[i].tg>=hb)
            sages.push_back(a[i]);
        else
            if(a[i].vg>=hb&&a[i].tg<hb)
                nm.push_back(a[i]);
        else
            if(a[i].vg<hb&&a[i].tg<hb&&a[i].vg>=a[i].tg)
                fm.push_back(a[i]);
        else
            sm.push_back(a[i]);
    }
    sort(sages.begin(),sages.end(),cmp);
    sort(nm.begin(),nm.end(),cmp);
    sort(fm.begin(),fm.end(),cmp);
    sort(sm.begin(),sm.end(),cmp);
    printf("%d\n",sages.size()+nm.size()+fm.size()+sm.size());
    for(i=0;i<sages.size();i++)
    {
        printf("%s %d %d\n",sages[i].number,sages[i].vg,sages[i].tg);
    }
    for(i=0;i<nm.size();i++)
    {
        printf("%s %d %d\n",nm[i].number,nm[i].vg,nm[i].tg);
    }
    for(i=0;i<fm.size();i++)
    {
        printf("%s %d %d\n",fm[i].number,fm[i].vg,fm[i].tg);
    }
    for( i=0;i<sm.size();i++)
    {
        printf("%s %d %d\n",sm[i].number,sm[i].vg,sm[i].tg);
    }
    return 0;
}