#include <iostream>
#include <cmath>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <queue>
#include <string>
#include <stack>
#include <set>
#include <vector>
#include <map>
#define mod 1e9+7
typedef long long ll;
using namespace std;
#define maxn 100010
int t;
int n,m;
struct node
{
int h;
int p;
}a[maxn];
int ans;
int b[maxn];
int q[maxn];
set<int>s1;
set<int>s2;
bool cmp(node a,node b)
{
return a.h<b.h;
}
int main()
{
int t;
scanf("%d",&t);
for(int i=1; i<=t; i++)
{
s1.clear();
s2.clear();
cin>>n>>m;
for(int i=1; i<=n; i++)
{
scanf("%d",&a[i].h);
}
for(int i=1; i<=m; i++)
{
scanf("%d",&b[i]);
}
for(int i=1; i<=n; i++)
{
scanf("%d",&a[i].p);
}
for(int i=1; i<=m; i++)
{
scanf("%d",&q[i]);
if(q[i]==0)
{
s1.insert(b[i]);
}
else
{
s2.insert(b[i]);
}
}
sort(a+1,a+1+n,cmp);
ans=0;
set<int>::iterator it;
for(int i=1; i<=n; i++)
{
if(a[i].p==0)
{
it=s2.begin();
if(it!=s2.end())
{
if(a[i].h>(*it))
{
ans++;
s2.erase(it);
}
}
}
else
{
it=s1.upper_bound(a[i].h);
if(it!=s1.end())
{
if(a[i].h<(*it))
{
ans++;
s1.erase(it);
}
}
}
}
cout<<ans<<endl;
}
return 0;
}
第二种解法
#include <iostream>
#include <cmath>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <queue>
#include <string>
#include <stack>
#include <utility>
#include <set>
#include <vector>
#include <map>
#define mod 1e9+7
#define inf 0x3f3f3f3f
typedef long long ll;
using namespace std;
const int maxn = 1e5;
struct node
{
ll h,p;
int id;
bool operator < (const node &a) const{
return h<a.h;
}
}num[maxn*2+5];
int main()
{
int t;
scanf("%d",&t);
while(t--){
int n,m;
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++) scanf("%lld",&num[i].h),num[i].id=1;
for(int j=n+1;j<=m+n;j++) scanf("%lld",&num[j].h),num[j].id=0;
for(int i=1;i<=n;i++) scanf("%lld",&num[i].p),num[i].id=1;
for(int j=n+1;j<=m+n;j++) scanf("%lld",&num[j].p),num[j].id=0;
sort(num+1,num+1+n+m);
int maleneed=0,famaleneed=0;
int ans=0;
for(int i=1;i<=m+n;i++){
if(num[i].id==1){
if(num[i].p==1) maleneed++;
else if(famaleneed>0) ans++,famaleneed--;
}else{
if(num[i].p==1) famaleneed++;
else if(maleneed>0) ans++,maleneed--;
}
}
printf("%d\n",ans);
}
return 0;
}