UVALive 6606 Meeting Room Arrangement 【搜索】

#include<iostream>
#include<algorithm>
#include<stdio.h>
using namespace std;
#define maxn 105

struct node {
    int s, e;
};

bool cmp(node x, node y){
    return x.e<y.e;
}

int main ()
{
    int T;
    scanf("%d",&T);
    node time[maxn];
    while(T--)
    {
        int pos=0,ans=0;
        while(1){
            scanf("%d%d",&time[pos].s,&time[pos].e);
            if(time[pos].s==0&&time[pos].e==0) break;
            pos++;
        }
        sort(time,time+pos,cmp);
        int ee = 0;
        for(int i=0;i<pos;i++){
            if(time[i].s>=ee){
                ans++;
                ee = time[i].e;
            }
        }
        printf("%d\n",ans);
    }
}