Advertisement
pdaogu

COMMON

Jun 4th, 2019
91
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.72 KB | None | 0 0
  1. #include <stdio.h>
  2. #include <stdlib.h>
  3. #include <string.h>
  4. #define maxn 1000030
  5.  
  6. int a[maxn]
  7. int b[maxn];
  8. int n, m, q = 0, emax = -1;
  9.  
  10. void input () {
  11.     scanf("%d%d", &n, &m);
  12.     for (int i = 0; i < n; ++i) {
  13.         scanf("%d", &a[i]);
  14.         if (emax < a[i])
  15.             emax = a[i];
  16.     }
  17.     for (int i = 0; i < m; ++i) {
  18.         scanf("%d", &b[i]);
  19.         if (emax < b[i])
  20.             emax = b[i];
  21.     }
  22. }
  23.  
  24. void output () {
  25.     printf("%d\n", q);
  26. }
  27.  
  28. void solve () {
  29.     int * f = (int*) malloc(sizeof(int) * (emax+1));
  30.     memset(f, 0, sizeof(int) * (emax+1));
  31.     for (int i = 0; i < n; ++i) {
  32.         f[a[i]] = 1;
  33.     }
  34.     for (int i = 0; i < m; ++i) {
  35.         if (f[b[i]]) {
  36.             ++q;
  37.             f[b[i]] = 0;
  38.         }
  39.     }
  40. }
  41.  
  42. int main () {
  43.     input();
  44.     solve();
  45.     output();
  46.     return 0;
  47. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement