1062 Talent and Virtue (25 分)

#include<iostream>
#include<string>
#include<algorithm>
using namespace std;

struct people{
    string name;
    int talent;
    int virtue;
};

bool cmp1(people a,people b)
{
    int totala=a.virtue+a.talent;
    int totalb=b.virtue+b.talent;
    if(totala!=totalb)
        return (a.virtue+a.talent)>(b.virtue+b.talent);
    else if(totala==totalb&&a.virtue!=b.virtue)
        return a.virtue>b.virtue;
    else
        return a.name<b.name;
}

people sage[100005];
people nobleman[100005];
people foolman[100005];
people smallman[100005];

int main()
{

    int n,l,h;
    cin>>n>>l>>h;
    int sum=0;
    string name;
    int t,v;
    int sagenum=0,noblemannum=0,foolmannum=0,smallmannum=0;
    for(int i=0;i<n;i++)
    {
        cin>>name>>v>>t;
        if(t>=h&&v>=h)
        {
            sum++;
            sage[sagenum].name=name;
            sage[sagenum].talent=t;
            sage[sagenum].virtue=v;
            sagenum++;
        }
        else if(t<h&&t>=l&&v>=h)
        {
            sum++;
            nobleman[noblemannum].name=name;
            nobleman[noblemannum].talent=t;
            nobleman[noblemannum].virtue=v;
            noblemannum++;
        }
        else if(t<h&&v<h&&t>=l&&v>=l&&v>=t)
        {
            sum++;
            foolman[foolmannum].name=name;
            foolman[foolmannum].talent=t;
            foolman[foolmannum].virtue=v;
            foolmannum++;
        }
        else if(v>=l&&t>=l)
        {
            sum++;
            smallman[smallmannum].name=name;
            smallman[smallmannum].talent=t;
            smallman[smallmannum].virtue=v;
            smallmannum++;
        }
    }

    cout<<sum<<endl;
    sort(sage,sage+sagenum,cmp1);
    for(int i=0;i<sagenum;i++)
        cout<<sage[i].name<<' '<<sage[i].virtue<<' '<<sage[i].talent<<endl;

    sort(nobleman,nobleman+noblemannum,cmp1);
    for(int i=0;i<noblemannum;i++)
        cout<<nobleman[i].name<<' '<<nobleman[i].virtue<<' '<<nobleman[i].talent<<endl;

    sort(foolman,foolman+foolmannum,cmp1);
    for(int i=0;i<foolmannum;i++)
        cout<<foolman[i].name<<' '<<foolman[i].virtue<<' '<<foolman[i].talent<<endl;

    sort(smallman,smallman+smallmannum,cmp1);
    for(int i=0;i<smallmannum;i++)
    {
        cout<<smallman[i].name<<' '<<smallman[i].virtue<<' '<<smallman[i].talent;
        if(i!=smallmannum-1)
            cout<<endl;
    }

    return 0;
}

德才论,挺简单的,就是最后一行不能输出换行忽略了…浪费了几分钟