AcWing 803. 区间合并
原题链接
简单
作者:
Mystery_1
,
2024-02-22 22:11:05
,
所有人可见
,
阅读 24
//ACWing803.区间合并
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
typedef pair<int,int> PII;
const int N=100010;
int n;
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(){
scanf("%d",&n);
for(int i=0;i<n;i++){
int l,r;
scanf("%d%d",&l,&r);
segs.push_back({l,r});
}
merge(segs);
printf("%d",segs.size());
return 0;
}