Acwing 907. 区间覆盖

1、将所有区间按照左端点从小到大排序

2、从前往后依次枚举每个区间，在所有能覆盖start的区间中，选择最右端点最大的区间，然后将start更新成右端点的最大值

#include <iostream>
#include <algorithm>

using namespace std;

const int N = 100010;

int n;

struct Range
{
    int l, r;
    bool operator < (const Range &w) const
    {
        return l < w.l;
    }
}range[N];

int main()
{
    int st, ed;
    scanf("%d %d", &st, &ed);
    scanf("%d", &n);
    
    for (int i = 0; i < n; ++ i)
    {
        scanf("%d %d", &range[i].l, &range[i].r);
    }
    
    sort(range, range + n);
    
    bool success = false;
    int res = 0;
    for (int i = 0; i < n; ++ i)
    {
        int j = i, r = -2e9;
        while (j < n && range[j].l <= st)
        {
            r = max(r, range[j].r);
            j ++;
        }
        
        if (r < st)
        {
            success = false;
            break;
        }
        
        res ++;
        if (r >= ed)
        {
            success = true;
            break;
        }
        
        st = r;
        i = j - 1;
    }
    
    if (!success) printf("-1\n");
    else printf("%d\n", res);
    
    return 0;
}