hdu 2037 貪心小水題

#include <cstdio>
#include <cstdlib>
using namespace std;
struct time
{
	int st, ed;
}a[100];

int cmp(const void *a, const void *b)
{
	return (*(time *)a).ed - (*(time *)b).ed;
}

int main()
{
	int n;
	while (~scanf("%d", &n), n)
	{
		for (int i=0;i<n;++i)
		{
			scanf("%d %d", &a[i].st, &a[i].ed);
		}
		
		qsort(a, n, sizeof(a[0]), cmp);
		
		int c = 1, t = 0;
		for (int i=1;i<n;++i)
		{
			if (a[i].st >= a[t].ed)
			{
				t = i;
				c++;
			}
		}
		printf("%d\n", c);
	}
	return 0;
}