ACM-会场安排问题

#include <iostream>
#include <algorithm>
using namespace std;

struct Activity
{
	int beg, end;
};

bool cmp(const Activity la, const Activity ra)
{
	return la.beg < ra.beg;
}

int main()
{
	int m, i, n, count, short_time;
	Activity  vec[10000];
	cin >> m;
	while (m--)
	{
		cin >> n;
		for (i = 0; i < n; ++i)
		{
			cin >> vec[i].beg >> vec[i].end;
		}
		sort(vec, vec + n, cmp);
		count = 1;
		for (i = 0; i < n; ++i)
		{
			if (i == 0 || vec[i].end < short_time)
			{
				short_time = vec[i].end;			
				continue;
			}			
			if (vec[i].beg > short_time)
			{
				short_time = vec[i].end;
				++count;
			}			
		}
		cout << count << endl;		
	}

	return 0;
}