pat甲级1062 Talent and Virtue

#include <iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int maxn=100010;
struct people{
    char id[10];
    int de,cai;
    int sum;
    int flag;
}peo[maxn];
bool cmp(people a,people b){
    if(a.flag!=b.flag) return a.flag<b.flag;
    else if(a.sum!=b.sum) return a.sum>b.sum;
    else if(a.de!=b.de) return a.de>b.de;
    else  return strcmp(a.id,b.id)<0;
}
int main()
{
    int n;
    int l,h;
    scanf("%d%d%d",&n,&l,&h);
    int m=n;
    for(int i=0;i<n;i++){
        scanf("%s%d%d",peo[i].id,&peo[i].de,&peo[i].cai);
        peo[i].sum=peo[i].de+peo[i].cai;
        if(peo[i].cai<l||peo[i].de<l){
            peo[i].flag=5;
            m--;
            }
        else if(peo[i].de>=h&&peo[i].cai>=h) peo[i].flag=1;
        else if(peo[i].de>=h&&peo[i].cai<h) peo[i].flag=2;
        else if(peo[i].de>=peo[i].cai) peo[i].flag=3;
        else peo[i].flag=4;
    }
    sort(peo,peo+n,cmp);
    cout<<m<<endl;

    for(int i=0;i<m;i++){
        printf("%s %d %d\n",peo[i].id,peo[i].de,peo[i].cai);
    }
    return 0;
}

坑点，bool中使用strcmp
①字符串1小于字符串2,strcmp函数返回一个负值;

②字符串1等于字符串2,strcmp函数返回零;

③字符串1大于字符串2,strcmp函数返回一个正值;
因为是bool，strcmp按照字典序比较，返回值是按照比较结果的