Acwing 905. 区间选点 -- 贪心

#include<iostream>
#include<algorithm>
using namespace std;
const int N=1e5+10;
struct range
{
    int l,r;
    bool operator <(const range & w)
    {
        return r<w.r;
    }
}a[N];
int main()
{
    int n;
    cin>>n;
    for(int i=0;i<n;i++) cin>>a[i].l>>a[i].r;
    sort(a,a+n);
    int res=0,point=-2e9;
    for(int i=0;i<n;i++)
    {
        if(a[i].l>point)
        {
            point=a[i].r;
            res++;
        }
    }
    cout<<res;
    return 0;
}