Codeforces#543 div2 A. Technogoblet of Fire(阅读理解)

#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;

const int maxn = 110;
int p[maxn], s[maxn];
vector<int> G[maxn];

int main() {
    int n, m, k;
    scanf("%d%d%d", &n, &m, &k);
    for (int i = 1; i <= n; i++) {
        scanf("%d", &p[i]);
    }
    for (int i = 1, k; i <= n; i++) {
        scanf("%d", &s[i]);
        G[s[i]].push_back(p[i]);
    }
    int ans = 0;
    for (int i = 1; i <= m; i++) sort(G[i].begin(), G[i].end());
    for (int i = 0, id; i < k; i++) {
        scanf("%d", &id);
        int size = G[s[id]].size();
        if (p[id] != G[s[id]][size-1]) ans++;
    }
    printf("%d\n", ans);
    return 0;
}