NYOJ-626-intersection set（二分查找）

题目链接

 /*
     Name:NYOJ-626-intersection set
     Copyright:
     Author:
     Date: 2018/4/12 21:30:10
     Description:
     二分查找水题
 */
 #include <iostream>
 #include <algorithm>
 #include <set>
 #include <cstdio>
 using namespace std;
 int nums1[], nums2[];
 int main()
 {
     ios::sync_with_stdio(false);
     int m, n;
     while (~scanf("%d %d", &m,&n)) {
         int tmp;
         for (int i=; i<m; i++) {
             scanf("%d", &nums1[i]);
         }
         for (int i=; i<n; i++) {
             scanf("%d", &nums2[i]);
         }
         sort(nums1, nums1+m);
         sort(nums2, nums2+n);
         int ct = ;
         for (int i=; i<m; i++) {
             if (binary_search(nums2, nums2+n, nums1[i]) == true) {
                 ct++;
             }
         }
         printf("%d\n", ct);
     }
     return ;
 }