http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=4090

题解：思维

1、配对的人喜好肯定不一样；

2、按不同喜好对身高排序；

3、O(n)方法匹配

C++版本一

/*
*@Author:   STZG
*@Language: C++
*/
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
//#define DEBUG
#define RI register int
#define endl "\n"
using namespace std;
typedef long long ll;
//typedef __int128 lll;
const int N=300000+10;
const int M=100000+10;
const int MOD=1e9+7;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
int t,n,m,k,p,l,r,u,v;
ll ans,cnt,flag,temp,sum;
char str;
struct node{
    int h,flag;
    bool operator <(const node&S)const{
        if(flag==S.flag){
            return h<S.h;
        }
        return flag<S.flag;
    }
}a[N],b[N];
int main()
{
#ifdef DEBUG
	freopen("input.in", "r", stdin);
	//freopen("output.out", "w", stdout);
#endif
    //ios::sync_with_stdio(false);
    //cin.tie(0);
    //cout.tie(0);
    scanf("%d",&t);
    while(t--){
        scanf("%d%d",&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].h);
        }
        for(int i=1;i<=n;i++){
            scanf("%d",&a[i].flag);
        }
        for(int i=1;i<=m;i++){
            scanf("%d",&b[i].flag);
        }
        sort(a+1,a+n+1);
        sort(b+1,b+m+1);
        ans=0;
        l=n+1;
        for(int i=1;i<=n;i++){
            if(a[i].flag){
                l=i;
                break;
            }
        }
        for(int i=1;i<=m;i++){
            if(l>n)
                break;
            if(!b[i].flag){
                if(a[l].h<b[i].h){
                    ans++;
                    l++;
                }
            }else{
                break;
            }
        }
        l=m+1;
        for(int i=1;i<=m;i++){
            if(b[i].flag){
                l=i;
                break;
            }
        }
        for(int i=1;i<=n;i++){
            if(l>m)
                break;
            if(!a[i].flag){
                if(b[l].h<a[i].h){
                    ans++;
                    l++;
                }
            }else{
                break;
            }
        }
        cout<<ans<<endl;
    }
 
#ifdef DEBUG
	printf("Time cost : %lf s\n",(double)clock()/CLOCKS_PER_SEC);
#endif
    //cout << "Hello world!" << endl;
    return 0;
}