pc教我发题解咯咯咯 右端点排序

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string.h>
#include <cstring>
#include <string>
#include <map>
#include <queue>
#include <deque>
using namespace std;
int n, endt, sum;
struct node {
	int start, end;
};
bool cmp(node a, node b) {
	return a.end < b.end;
}
node hd[1010];
int main() {
	ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
	cin >> n;
	for (int i = 1;i <= n;i++)cin >> hd[i].start >> hd[i].end;
	sort(hd + 1, hd + 1 + n, cmp);
	sum = 1;
	endt = hd[1].end;
	for (int i = 2;i <= n;i++) {
		if (hd[i].start >= endt) {
			sum++;
			endt = hd[i].end;
		}
	}
	cout << sum;
	return 0;
}