贪心-区间问题

#include <iostream>
#include <algorithm>
using namespace std;

const int N = 100010;

int n;
struct Range{
    int l, r;
};
Range range[N];
bool cmp(Range a, Range b)
{
    return a.r <= b.r;
}
int main()
{
    cin>>n;
    for(int i = 0; i < n;i ++)
    {
        int a, b;
        cin>>a>>b;
        range[i] = {a,b};
    }
    sort(range, range+n, cmp);
    
    int res = 0, ed = -2e9;
    for(int i = 0 ; i<n;i++)
        if(range[i].l > ed)
        {
            res++;
            ed = range[i].r;
        }
        
    cout<<res<<endl;
}