803. 区间合并

贪心法

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef pair<int, int> PII;
vector<PII> segs;
void merge(vector<PII>& segs){
    vector<PII> res;
    sort(segs.begin(), segs.end());
    int st = -2e9, ed = -2e9;
    for(auto seg: segs){
        if(ed < seg.first){
            if(st != -2e9){
                res.push_back({st, ed});
            }
            st = seg.first;
            ed = seg.second;
        }else ed = max(ed, seg.second);
    }
    if(st != -2e9) res.push_back({st, ed});
    segs = res;
}
int main(){
    int n;
    cin>>n;
    for(int i = 0; i < n; i++){
        int u, v;
        cin>>u>>v;
        segs.push_back({u, v});
    }
    merge(segs);
    cout<<segs.size()<<endl;
    
    
    return 0;
}