```cpp
#include <iostream>
#include <algorithm>
using namespace std;
struct ks{
long long ai;
long long bi;
}a[1000005];
bool cmp(ks a,ks b)
{
return a.bi<b.bi;
};
int main()
{
long long n,ans=1,k=1;
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>a[i].ai>>a[i].bi;
}
sort(a+1,a+1+n,cmp);
for(int i=2;i<=n;i++)
{
if(a[i].ai>=a[k].bi)
ans++;
else
continue;
k=i;
}
cout<<ans;
}
```
## **求关OwO**
by lsd110504 @ 2024-10-13 14:00:35
@[tangyiqi](/user/1349478)
by lsd110504 @ 2024-10-13 14:27:57
@[lsd110504](/user/1234924)
谢谢
by tangyiqi @ 2024-10-14 22:44:55
@[lsd110504](/user/1234924)
已关
by tangyiqi @ 2024-10-14 22:45:18
@[lsd110504](/user/1234924)
求回关，求[加团](https://www.luogu.com.cn/team/89978)
by tangyiqi @ 2024-10-15 22:07:12