AcWing 803. 区间合并
原题链接
简单
作者:
dsyami
,
2021-05-11 10:15:08
,
所有人可见
,
阅读 163
#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(int i = 0; i < segs.size(); i ++ )
{
if(ed < segs[i].first)
{
if(st != -2e9) res.push_back({st, ed});
st = segs[i].first;
ed = segs[i].second;
}
else
{
ed = max(ed, segs[i].second);
}
}
if(st != -1e9) res.push_back({st, ed});
segs = res;
}
int main()
{
int n;
cin >> n;
while(n -- )
{
int l, r;
cin >> l >> r;
segs.push_back({l, r});
}
merge(segs);
cout << segs.size() << endl;
return 0;
}