Submission #73818667

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

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

    long long int N, M;
    cin >> N >> M;

    vector<int> C(M + 1);
    for (int i = 1; i <= M; i++) {
        cin >> C[i];
    }

    long long total = 0; 

    vector<int> a(M + 1, 0);

    for (int i = 0; i < N; i++) {
        int K;
        cin >> K;

        int max_p = 0;
        for (int j = 0; j < K; j++) {
            int p;
            cin >> p;
            a[p]++;
            if (p > max_p) {
                max_p = p;
            }
        }

        for (int q = 1; q <= max_p; q++) {
            if (a[q] <= C[q]) {
                total += a[q];
            }

            a[q] = 0;
        }
    }
    cout << total << endl;
    return 0;
}

Submission Info

Judge Result