代码:
#include<bits/stdc++.h>
#define PII pair<int,int>
#define fi first
#define se second
#define int long long
using namespace std;
const int N = 1e5+10;
int n,m1,m2;
PII va[N],vb[N];
priority_queue<int,vector<int>,greater<int>> q1,q2;
int solve(int sum1,int sum2)
{
while(q1.size()) q1.pop();
while(q2.size()) q2.pop();
int ans = 0;
for(int i=1;i<=m1;i++)
{
while(q1.size()&&q1.top()<va[i].fi) q1.pop();
if(q1.size()<sum1)
{
ans++;
q1.push(va[i].se);
}
}
for(int i=1;i<=m2;i++)
{
while(q2.size()&&q2.top()<vb[i].fi) q2.pop();
if(q2.size()<sum2)
{
ans++;
q2.push(vb[i].se);
}
}
return ans;
}
signed main()
{
// freopen("w.in","r",stdin);
// freopen("ho.out","w",stdout);
cin>>n>>m1>>m2;
for(int i=1;i<=m1;i++) cin>>va[i].fi>>va[i].se;
for(int i=1;i<=m2;i++) cin>>vb[i].fi>>vb[i].se;
sort(va+1,va+1+m1);
sort(vb+1,vb+1+m2);
int maxn = 0;
for(int i=0;i<=n;i++)
{
if(i*(m1+m2)>5e7) break;
maxn = max(maxn,solve(i,n-i));
}
cout<<maxn;
return 0;
}
#include<bits/stdc++.h>
#define PII pair<int,int>
#define fi first
#define se second
#define int long long
using namespace std;
const int N = 1e5+10;
int n,m1,m2;
PII va[N],vb[N];
int cnt1[N],cnt2[N];
priority_queue<PII,vector<PII>,greater<PII>> q1,q2;
int solve1()
{
for(int i=1;i<=n;i++) q1.push({0,i});
for(int i=1;i<=m1;i++)
{
int min_id = 1e9;
vector<PII > v;
while(q1.size()&&q1.top().fi<=va[i].fi)
{
v.push_back(q1.top());
if(min_id>q1.top().se) min_id = q1.top().se;
q1.pop();
}
for(auto t:v)
{
if(t.se==min_id) q1.push({va[i].se,t.se});
else q1.push({0,t.se});
}
if(min_id!=1e9) cnt1[min_id]++;
}
for(int i=1;i<=n;i++) cnt1[i] = cnt1[i]+cnt1[i-1];
}
int solve2()
{
for(int i=1;i<=n;i++) q2.push({0,i});
for(int i=1;i<=m2;i++)
{
int min_id = 1e9;
vector<PII > v;
while(q2.size()&&q2.top().fi<=va[i].fi)
{
v.push_back(q2.top());
if(min_id>q2.top().se) min_id = q2.top().se;
q2.pop();
}
for(auto t:v)
{
if(t.se==min_id) q2.push({va[i].se,t.se});
else q2.push({0,t.se});
}
if(min_id!=1e9) cnt2[min_id]++;
}
for(int i=1;i<=n;i++) cnt2[i] = cnt2[i]+cnt2[i-1];
}
signed main()
{
// freopen("w.in","r",stdin);
// freopen("ho.out","w",stdout);
cin>>n>>m1>>m2;
for(int i=1;i<=m1;i++) cin>>va[i].fi>>va[i].se;
for(int i=1;i<=m2;i++) cin>>vb[i].fi>>vb[i].se;
sort(va+1,va+1+m1);
sort(vb+1,vb+1+m2);
solve1();solve2();
int anw = 0;
for(int i=0;i<=n;i++) anw = max(anw,cnt1[i]+cnt2[n-i]);
cout<<anw;
return 0;
}