Cod sursa(job #3267819)
| Utilizator | Data | 12 ianuarie 2025 14:31:50 | |
|---|---|---|---|
| Problema | Aprindere | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.79 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("aprindere.in");
ofstream out("aprindere.out");
int main()
{
int n, m, v[1002], a, t, c, v2[1002], s = 0;
int inchis = 0;
in >> n >> m;
for(int i = 0; i < n; i++)
in >> v[i];
for(int i = 0; i < m; i++){
in >> a >> t >> c;
inchis = 0;
for(int j = 0; j < c; j++){
in >> v2[j];
if(!v[v2[j]])
inchis++;
}
if(inchis >= c / 2){
for(int j = 0; j < c; j++)
if(!v[v2[j]])
v[v2[j]] = 1;
else
v[v2[j]] = 0;
s += t;
}
}
out << s;
return 0;
}