~~你这棕名好耀眼~~
```cpp
#include<bits/stdc++.h>
#define MAXN 1001000
using namespace std;
struct node{
int begin;
int end;
}a[MAXN];
bool cmp(node x,node y){
return x.end<y.end;
}
int main(){
int n,cnt=1,t;
cin>>n;
for(int i=0;i<n;i++)
cin>>a[i].begin>>a[i].end;
sort(a,a+n,cmp);
t=a[0].end;
for(int i=0;i<n;i++){
if(a[i].begin>=t){
cnt++;
t=a[i].end;
}
}
cout<<cnt;
return 0;
}
```
by csxx601cjy @ 2024-06-17 21:49:22
~~你这棕名好耀眼~~
by hkdzyhk @ 2024-06-22 15:52:23
没啥好说的，上代码！
```cpp
#include<bits/stdc++.h>
using namespace std;
int n,ans=1;
struct node{
int a,b; //开始 结束
}t[1000005];
bool cmp(const node &x,const node &y){
if(x.b<y.b) return 1;
else if(x.b==y.b){
if(x.a<y.a) return 1;
else return 0;
}
return 0;
}
int main(){
scanf("%d",&n);
for(int i=1;i<=n;i++) scanf("%d%d",&t[i].a,&t[i].b);
sort(t+1,t+n+1,cmp);
int ed=t[1].b;
for(int i=2;i<=n;i++){
if(t[i].a>=ed){
ed=t[i].b;
ans++;
}
}
cout<<ans;
return 0;
}
```
by hkdzyhk @ 2024-09-01 22:19:31
快谢谢董大大
by hkdzyhk @ 2024-09-01 22:19:53