AcWing 803. 区间合并
原题链接
简单
作者:
小王子_19
,
2024-04-04 10:43:30
,
所有人可见
,
阅读 1
C++ 代码 (y总代码)
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
typedef pair<int, int> PII;
const int N = 100010;
int n;
vector<PII> segs, res;
void merge(vector<PII> &segs)
{
sort(segs.begin(), segs.end());
int st = -2e9, ed = -2e9;
for (int i = 0; i < n; 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 != -2e9) res.push_back({st, ed});
}
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 << res.size() << endl;
return 0;
}