UVA_11678_Exchanging_Cards

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <set>
#define N 1000000
#define LL unsigned long long
using namespace std;

int main() {
    int a,b;bool encontro,entro; int tradea,tradeb,ant;
 while(scanf("%d %d",&a,&b)){
    if(a==0 && b==0) break;
    int alice[a+1];int betty[b+1];
    for(int i=0;i<a;i++){
        scanf("%d",&alice[i]);
    }
    for(int i=0;i<b;i++){
        scanf("%d",&betty[i]);
    }
    tradea=0; tradeb=0;ant=0;
    for (int i=0;i<a;i++){
        encontro=false;entro=true;
                if(ant!=alice[i]){
                    for (int j=0;j<b;j++){
            if(alice[i]==betty[j]){
                encontro=true;
                break;
            }else if(betty[j]>alice[i]){
                break;
            }
        }
                } else entro=false;

       if((!encontro) && (entro)) tradea++;
                ant=alice[i];
    }
        ant=0;
    for (int i=0;i<b;i++){
        encontro=false;
                entro=true;
                if(ant!=betty[i]){
        for (int j=0;j<a;j++){
            if(alice[j]==betty[i]){
                encontro=true;
                break;
            }else if(alice[j]>betty[i]){
                break;
            }
        }
                }else entro=false;
       if((!encontro) && (entro)) tradeb++;
                ant=betty[i];
    }
    if(tradea<tradeb){
        printf("%d\n",tradea);
    }else {
        printf("%d\n",tradeb);
    }
 }
    return 0;
}