区间合并acwing803

#include <iostream>
using namespace std;
#include <vector>
#include <algorithm>
vector<pair<int,int>>a;
int main()
{
	int n;
	cin>>n;
	for(int i = 0; i < n; i++){
		int l,r;
		cin>>l>>r;
		a.push_back({l,r});
	}
	sort(a.begin(),a.end());
	int ed = a[0].second;
	int cnt = 0;
	for(int i = 1; i < n; i++){
		if(a[i].first <= ed){
			cnt++;
			ed = max(ed,a[i].second);
		}else ed = a[i].second;
	}
	cout<<n - cnt;
	return 0;
}