#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
int n, ans;
struct oj{
int l, r;
}a[N];
bool cmp(oj i, oj j){
return i.r < j.r;
}
int main(){
int L = -1;
cin >> n;
for(int i = 1; i <= n; i++)
cin >> a[i].l >> a[i].r;
sort(a + 1, a + n + 1, cmp);
for(int i = 1; i <= n; i++){
if(a[i].l >= L){
ans ++;
L = a[i].r;
}
}
cout << ans << endl;
return 0;
}
P1803 凌乱的yyy / 线段覆盖
![](https://img-home.csdnimg.cn/images/20240711042549.png)