Submission #71836101

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define int long long
void solve(){
	int h,w,n;
	cin>>h>>w>>n;
	vector<vector<int>>a(h,vector<int>(w,0));
	for(int i=0;i<h;i++){
		for(int j=0;j<w;j++){
			cin>>a[i][j];
		}
	}
	map<int,int>mp;
	while(n--){
		int x;
		cin>>x;
		mp[x]=1;
	}
	int maxn=0;
	for(int i=0;i<h;i++){
		int count=0;
		for(int j=0;j<w;j++){
			if(mp.count(a[i][j]))count++;
		}
		maxn=max(maxn,count);
	}
	cout<<maxn<<"\n";	
}
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	int T=1;//cin>>T;
	while(T--) solve();
	return 0;
}

Submission Info

Judge Result