区间重叠问题

Problem - D - Codeforces

正解：

#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
vector<P> mp;
vector<int> ans;
int main()
{
	ios::sync_with_stdio(false);
	int n,k;
	cin>>n>>k;
	for(int i=1;i<=n;i++)
	{
		int x,y;
		cin>>x>>y;
		mp.push_back(make_pair(x,0));
		mp.push_back(make_pair(y,1));
	}
	sort(mp.begin(),mp.end());
	int cut=0;
	for(int i=0;i<mp.size();i++)
	{
		if(mp[i].second==0)
		{
			cut++;
			if(cut==k) ans.push_back(mp[i].first);
		}else
		{
			if(cut==k) ans.push_back(mp[i].first);
			cut--;
		}
	}
	cout<<ans.size()/2<<endl;
	for(int i=0;i<ans.size();i+=2)
	{
		cout<<ans[i]<<" "<<ans[i+1]<<endl;
	}
	return 0;
}

TLE解：（TLE48）

#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e6+10;
char a[maxn];
pair<long long,long long> p[maxn];
int main()
{
	ios::sync_with_stdio(false);
	int n,k;
	cin>>n>>k;
	map<long double,long long> mp;
	for(int i=1;i<=n;i++)
	{
		long long x,y;
		cin>>x>>y;
		mp[x]++;
		mp[y+0.5]--;
	}
	map<long double ,long long >::iterator it;
	it = mp.begin();
	int cshu = it->second;
	long long l = it->first,R;
	it++;
	bool flag=0;
	int c=0;
	for(it;it!=mp.end();it++)
	{
		long double r = it->first;
		cshu>=k?flag=1,R=(long long)(r),r<0?R--:R:flag==1?p[++c]=make_pair(l,R),flag=0,l=r:l=r;
		cshu+=it->second;
	}
	if(flag==1)
	{
		p[++c]=(make_pair(l,R));
	}
	cout<<c<<endl;
	for(int i=1;i<=c;i++)
	{
		cout<<p[i].first<<" "<<p[i].second<<endl;
	}
	return 0;
}