Codeforces Round #543 (Div. 2, based on Technocup 2019 Final Round) A. Technogoblet of Fire(思维)

#include <bits/stdc++.h>
#define ll long long
using namespace std;
int n,m,k;
int a[105],b[105];
map<int,int> ma;

int main()
{
  cin>>n>>m>>k;
  for(int i=1;i<=n;i++){
    cin>>a[i];
  }
  for(int i=1;i<=n;i++){
    cin>>b[i];
    ma[b[i]] = max(ma[b[i]], a[i]);
  }
  int ans = 0;
  for(int i=0;i<k;i++){
    int xx;
    cin>>xx;
    if(ma[b[xx]] != a[xx])ans++;
  }
  cout<<ans<<endl;
  return 0;
}