1234 开门人和关门人

用sort对结构体排序的运用。

#include<string.h>
#include<stdio.h>
#include<stdlib.h>
#include<algorithm>
using namespace std;

typedef struct people
{
    char s[109];
    char ss[109];
    char sss[109];
}point;

point gg[108];

int cmp(people a,people b)
{
    if(strcmp(a.ss,b.ss)<0)
        return 1;
    return 0;
}

int cmp1(people a,people b)
{
    if(strcmp(a.sss,b.sss)>0)
        return 1;
    return 0;
}

int main()
{
    int N,n,i;
    scanf("%d",&N);
    while(N--)
    {
        scanf("%d",&n);
        getchar();
        for(i=0;i<n;i++)
        {
            scanf("%s",gg[i].s);
            scanf("%s",gg[i].ss);
            scanf("%s",gg[i].sss);
        }
        sort(gg,gg+n,cmp);
        printf("%s ",gg[0].s);
        sort(gg,gg+n,cmp1);
        printf("%s\n",gg[0].s);
    }
	return 0;
}