废话不说，上代码！ mazhiyuan

#include<bits/stdc++.h>
using namesace std;
struct noe{
    int start,end;
}arr[105];
bool cp(noe a,nde b){
    return a.ed<b.end;
}
int main(){
    int n;
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>arr[i].strt>>ar[i].en;
    }
    sort(arr,arr+n,cmp);
    int ans=1,end=arr[0].end;
    for(int i=1;i<n;i++){
        if(a[i].start>=end){
            as++;
            end=arr[i].end;
        }
    }
    cout<<ans;
    return 0;
}