Submission #74355192

---

Source Code Expand

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

int main() 
{
    int N, M, K;
    cin >> N >> M >> K;
    vector<pair<int,int>> order; 
    vector<vector<int>> ingredients(N);
    for (int i = 0; i < N; i++) {
        int V, C;
        cin >> V >> C;
        order.push_back({V, i});
        ingredients[i].resize(C);
        for (int j = 0; j < C; j++) {
            cin >> ingredients[i][j];
        }
    }
    sort(order.begin(), order.end(), [](auto &a, auto &b) {
        if (a.first != b.first)
            return a.first > b.first;
        return a.second < b.second;
    });
    vector<int> freq(M + 1, 0);
    for (int i = 0; i < K; i++) {
        int idx = order[i].second;
        for (int x : ingredients[idx]) {
            freq[x]++;
        }
    }
    int ans = 0;
    for (int i = 1; i <= M; i++) {
        if (freq[i] == K) ans++;
    }
    cout << ans << '\n';
}
// A - Cooking Contest and Ingredients

Submission Info

Judge Result