Beecrowd 1104

 avatarkaziamir
c_cpp
2 months ago
858 B
1
Indexable
Never
#include<bits/stdc++.h>
using namespace std;

int alice[100005];
int betty[100005];

void zero(){
    for(int i=0;i<100001;i++){
        alice[i]=0;
        betty[i]=0;
    }
}

void scan(int limit, int n){
    int X;
    for(int i=0;i<limit;i++){
        cin>>X;

        if(n==1){
            alice[X]++;
        }
        else if(n==2){
            betty[X]++;
        }
    }
}

int main(){
    int A,B;
    while(cin>>A>>B){
    	zero();
        if(A==0 && B==0){
            break;
        }

        int X[A];
        int Y[B];

        scan(A,1);
        scan(B,2);

        int alice_C=0, betty_C=0;

        for(int i=0;i<100001;i++){
            if(alice[i]!=0 && betty[i]==0) alice_C++;
            if(betty[i]!=0 && alice[i]==0) betty_C++;
        }
        (alice_C>=betty_C) ? cout<<betty_C<<endl : cout<<alice_C<<endl;
    }

    return 0;
}