C++ 代码

#include<iostream>
#include<algorithm>
using namespace std;
struct point{
    int str;
    int end;
}p[100010];
bool cmp(point a,point b){
    if(a.str == b.str) return a.end < b.end;
    else return a.str < b.str;
}
int main(){
    int n;
    cin >> n;
    for(int i=0;i<n;i++){
        cin >> p[i].str >> p[i].end;
    }
    sort(p,p+n,cmp);
    int x;
    int num=1;
    x = p[0].end;
    for(int i=1;i<n;i++){
        if(p[i].str > x) num++;
        if(p[i].end > x) x = p[i].end;
    }
    cout << num;
}