Submission #71832761

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <deque>
#include <vector>
#include <queue>
#include <cmath>
#include <unordered_set>
#include <unordered_map>
#include <map>
#include <set>
#include <string>
using namespace std;

int n, m, q;
int a[4][6];
unordered_set<int> st;

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

	cin >> n >> m >> q;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			cin >> a[i][j];
		}
	}
	for (int i = 0; i < q; i++) {
		int num;
		cin >> num;
		st.insert(num);
	}

	int ret = 0;
	for (int i = 0; i < n; i++) {
		int cnt = 0;
		for (int j = 0; j < m; j++) {
			if (st.count(a[i][j])) {
				cnt++;
			}
		}
		ret = max(ret, cnt);
	}
	cout << ret;
}

Submission Info

Judge Result