Pagini recente » Cod sursa (job #355630) | Cod sursa (job #374184) | Cod sursa (job #1693891) | Cod sursa (job #1907235) | Cod sursa (job #2162868)
#include <cstdio>
#include <cmath>
using namespace std;
struct aprindere{
int t, nrc;
}v[1005];
int m[1005][1005], xizt[1005];
int main()
{
freopen("aprindere.in","r",stdin);
freopen("aprindere.out","w",stdout);
int n,k;
scanf("%d %d",&n,&k);
for(int i = 0; i < n; ++i)
scanf("%d",&xizt[i]);
for(int i = 1; i <= k; ++i)
{
int x;
scanf("%d",&x);
scanf("%d",&v[x].t);
scanf("%d",&v[x].nrc);
for(int j=1;j<=v[x].nrc;++j)
scanf("%d",&m[x][j]);
}
int ans=0;
for(int i=0;i<n;++i)
{
if(xizt[i]==0)
{
ans+=v[i].t;
for(int j=1;j<=v[i].nrc;++j)
{
xizt[m[i][j]]=xizt[m[i][j]]-1;
}
}
}
printf("%d",ans);
return 0;
}