题意:求集合A和B中有几个相同的元素,其中集合中元素已经按升序排好,集合的元素个数n<=1000000,m<=1000000
思路:对每一个B中的元素,都在A中进行二分查找
代码:
#include<cstdio>
using namespace std;
int a[1000005];
int bi_search(int key,int n)
{
int low=0,mid,high=n-1;
while(low<=high)
{
mid=(low+high)/2;
if(a[mid]==key)
return 1;
else if(a[mid]<key)
low=mid+1;
else
high=mid-1;
}
return 0;
}
int main()
{
int ans;
int flag;
int key;
int n,m;
while(scanf("%d%d",&n,&m),n||m)
{
for(int i=0; i<n; i++)
scanf("%d",&a[i]);
ans=0;
for(int i=0; i<m; i++)
{
scanf("%d",&key);
ans=ans+bi_search(key,n);
}
printf("%d\n",ans);
}
return 0;
}