RT，样例1&2能过，3过不了，求助

思路来源

code：（代码中有少量调试）

#include<iostream>
#include<algorithm>
#include<queue>
#include<cstdio>
using namespace std;
int n,m1,m2;
struct node{
	int come,leave;
}a[5000005],b[5000005];
struct point{
	int come;
	int leave;
	int pos;
	bool operator < (const point &x) const
	{
		return leave>x.leave;
	}
};
priority_queue <point> q1,q2;
bool cmp(node x,node y){
	return x.come<y.come;
}
int can1[5000005],can2[5000005];
int qian1[5000005],qian2[5000005];
queue <int> putout1,putout2;
int maxn1=1,maxn2=1;
int main(){
	cin>>n>>m1>>m2;
	for(int i=1;i<=m1;i++)
		cin>>a[i].come>>a[i].leave;
	for(int i=1;i<=m2;i++)
		cin>>b[i].come>>b[i].leave;
	sort(a+1,a+m1+1,cmp);
	sort(b+1,b+m2+1,cmp);
	for(int i=1;i<=m1;i++){
		while(q1.size()&&q1.top().leave<a[i].come)
			putout1.push(q1.top().pos),q1.pop();
		if(putout1.size()){
			can1[putout1.front()]++,q1.push((point){a[i].come,a[i].leave,putout1.front()}),putout1.pop();
		}
		else
			can1[maxn1]++,q1.push((point){a[i].come,a[i].leave,maxn1}),maxn1++;
	}
	for(int i=1;i<=m2;i++){
		while(q2.size()&&q2.top().leave<b[i].come)
			putout2.push(q2.top().pos),q2.pop();
		if(putout2.size()){
			can2[putout2.front()]++,q2.push((point){b[i].come,b[i].leave,putout2.front()}),putout2.pop();
		}
		else
			can2[maxn2]++,q2.push((point){b[i].come,b[i].leave,maxn2}),maxn2++;
	}
	for(int i=1;i<=n;i++)
		qian1[i]+=qian1[i-1]+can1[i];
	for(int i=1;i<=n;i++)
		qian2[i]+=qian2[i-1]+can2[i];
	int ans=0;
	for(int i=0;i<=n;i++)
		ans=max(ans,qian1[i]+qian2[n-i]),cout<<qian1[i]<<" "<<qian2[n-i]<<endl;
	cout<<ans;
	return 0; 
}