HDU 2037（贪心）

#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<vector>
#include<algorithm>
#include<iostream>
#include<time.h>
using namespace std;

struct node
{
    int start;
    int end;
}Time[105];

bool cmp(node a, node b)
{
    if (a.end == b.end)
        return a.start > b.start;
    else
        return a.end<b.end;
}

int main()
{
    int n;
    while (scanf("%d", &n) != EOF)
    {
        int i;
        if (n == 0)   
            break;
        int sum = 1;
        int k = 0;
        for (i = 0; i < n; i++)
        {
            scanf("%d%d", &Time[i].start, &Time[i].end);
        }
        sort(Time, Time + n, cmp);
        for (i = 1; i<n; i++)
        {
            if (Time[i].start >= Time[k].end)
            {
                sum++;
                k = i;
            }
        }
        printf("%d\n", sum);
    }
    return 0;
}