（TOJ3114）{A}∩{B}

描述

Given two integer sets A and B sorted descendingly, you are asked to output the element count of A∩B.

输入

Standard input will contain multiple test cases. The first line of the input is a single integrate T (1 <= T <= 50) which is the number of test cases. then T consecutive test cases followed. In each test case, there has four lines. The first line contains the element count N(1<=N<=100000) for the first set. The second line contains N integers in the first set.
The third line contains the element count M(1<=M<=100000) for the second set. The fourth line contains M integers in the second set.

NOTE: there will be no duplicate elements in each sets and all the integers in each set have been sorted descendingly.

输出

For each test case in the input, there's only one line output that contains the element count of the intesection of the two sets.

样例输入

1
5
5 4 3 2 1
4
5 3 1 -1

样例输出

3

#include<stdio.h>
#include<string.h>
#include<ctype.h>
#include<math.h>

int a[100001],b[100001];

void deal(int c[], int n, int d[], int m)
{
    int i,j,flag;
    flag=i=j=0;
    while(i<n && j<m){
        if(c[i]<d[j]){j++;}
        else if(c[i]==d[j]){
            flag++;
            i++; j++;
        }else{
          i++;    
        }
    }
    printf("%d\n",flag);
}

void solve()
{
    int T,n,m,i;
    scanf("%d",&T);
    while(T--){
        scanf("%d",&n);
        for(i=0; i<n; i++){
            scanf("%d",&a[i]);
        }
        scanf("%d",&m);
        for(i=0; i<m; i++){
            scanf("%d",&b[i]);
        }
        deal(a,n,b,m);        
    }
}

int main()
{
    solve();
    return 0;
}