Pagini recente » Cod sursa (job #1928936) | Cod sursa (job #580812) | Cod sursa (job #1172729) | Cod sursa (job #420765) | Cod sursa (job #1554929)
# include <fstream>
# include <algorithm>
using namespace std;
ifstream cin ( "aprindere.in" );
ofstream cout ( "aprindere.out" );
int n, m, i, j, t, s, c ,aprins[1005], timp[1005], nr[105], a;
// pair < int, int > p;
int main ()
{
cin >> n >> m;
for ( i = 0; i < n; i ++ )
{
cin >> aprins[i];
}
while ( m -- )
{
cin >> c;
cin >> timp[c] >> nr[c];
if ( aprins[c] )
{
for ( t = 1; t <= nr[c]; t ++ )
cin >> a;
}
else
{
s = s + timp[c];
for ( t = 1; t <= nr[c]; t ++ )
{
cin >> a;
if ( aprins[a] )
aprins[a] = 0;
else
aprins[a] = 1;
}
}
}
cout << s;
return 0;
}