Submission #75971872

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define all(x) (x).begin(), (x).end()
#define pb push_back

template<class T> inline bool chmax(T& a, T b) { return a < b ? a = b, 1 : 0; }
template<class T> inline bool chmin(T& a, T b) { return a > b ? a = b, 1 : 0; }

const int MOD = 1e9 + 7;

void solve() {
    int k,m;cin>>k>>m;
    unordered_set<int> mp;
    for(int i=0;i<k;i++){
        int x;cin>>x;
        mp.insert(x);
    }
    int ans=0;
    for(int i=0;i<m;i++){
        int x;cin>>x;
        if(mp.count(x))ans++;
    }
    cout<<ans<<'\n';
    
    
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int tt = 1;
    //cin >> tt;

    while (tt--) {
        solve();
    }

    return 0;
}

Submission Info

Judge Result