#include <algorithm> #include <iostream> #include <set> using namespace std; void Slove(int n) { set<int> S; int C=0, number, q, T; for (int i=0; i<n; ++i) { cin >> number; S.insert(number); } cin >> q; for (int i=0; i<q; ++i) { cin >> T; if ( S.find(T) != S.end() ) ++C; } cout << C << endl; } int m…</q;></n;></int></set></iostream></algorithm>

#include <algorithm> #include <iostream> #include <set> using namespace std; void Slove(int n) { set<int> S; int C=0, number, q, T; for (int i=0; i<n; ++i) { cin >> number; S.insert(number); } cin >> q; for (int i=0; i<q; ++i) { cin >> T; if ( S.find(T) != S.end() ) ++C; } cout << C << endl; } int m…</q;></n;></int></set></iostream></algorithm>