4035800_ac_141ms_596k.cpp

北大大牛代码 1240道题的原代码 超级权威

#include <algorithm>

using namespace std;

struct node
{
    int x, y;
	bool operator < (const node &t)	const
	{
		return x < t.x || (x == t.x && y < t.y);
	}
}m[50002];

int main()
{
    int n, i, t, mac;

	while (scanf("%d", &n), n)
	{
		for (i = 0; i < n; i++)
		{
			scanf("%d%d", &m[i].x, &m[i].y);
		}
		sort(m, m + n);
		t = 1;
		mac = m[n - 1].y;
		for (i = n - 2; i >= 0; i--)
		{
			if(mac < m[i].y)
			{
				mac = m[i].y;
				t++;
			}
		}
		printf("%d\n", t);
	}
	return 0;
}