Acwing_906区间分组

AC代码:

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

const int N = 100010;
int n;

struct Node {
	int l, r;
	bool operator <(const Node& w)const
	{
		return r < w.r;
	}
}node[N];

int main()
{
	scanf("%d", &n);

	for (int i = 0; i < n; i++)
	{
		int l, r;
		scanf("%d%d", &l, &r);
		node[i] = { l,r };
	}

	sort(node, node + n);

	int res = 0, ed = -2e9;
	for (int i = 0; i < n; i++)
	{
		if (node[i].l > ed)
		{
			ed = node[i].r;
			res++;
		}
	}
	printf("%d", res);

	system("pause");
	return 0;
}