1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
#include <bits/stdc++.h>
using namespace std;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    
    int k, n;
    cin >> k >> n;
    int worker_count = n;
    
    for (int i = 1; i < k; i++) {
        int a;
        cin >> a;
        
        map<int, int> mapa;
        for (int j = 0; j < a; j++) {
            int x;
            cin >> x;
            if (x != 0) mapa[x]++;
        }
        
        int zajeci = (int)mapa.size();
        int extra = 0;
        for (auto& [key, val] : mapa) {
            extra += val - 1;
        }
        
        int wolni = worker_count - zajeci;
        int wolne_wyklady = a - zajeci - extra;
        int nowi = max(0, wolne_wyklady - wolni);
        worker_count += nowi + extra;
    }
    
    cout << worker_count << endl;
    return 0;
}