AcWing 803. 区间合并
原题链接
简单
作者:
一块两毛五
,
2024-04-02 00:45:47
,
所有人可见
,
阅读 2
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
const int N = 1e5 + 10;
int n;
vector<pair<int, int>> segs;
void merge(vector<pair<int, int>> &segs)
{
vector<pair<int, int>> res;
sort(segs.begin(), segs.end());
int st = -2e9, ed = -2e9;
for(auto c : segs)
{
if(ed < c.first)
{
if(st != -2e9)
{
res.push_back({st, ed});
}
st = c.first, ed = c.second;
}
else{
ed = max(ed, c.second);
}
}
if(st != -2e9)
res.push_back({st, ed});
segs = res;
}
int main()
{
cin >> n;
for(int i = 0; i < n; i++)
{
int l, r;
cin >> l >> r;
segs.push_back({l, r});
}
merge(segs);
cout << segs.size();
return 0;
}