Pagini recente » Cod sursa (job #2642553) | Cod sursa (job #1468149) | Cod sursa (job #1745661) | Cod sursa (job #2264455) | Cod sursa (job #2180857)
#include <fstream>
using namespace std;
ifstream fin ("aprindere.in");
ofstream fout ("aprindere.out");
int o,i,n,j,m,mini,unu,maxi,k,p,v[1001],sc[1001],ci[1001],t[1001],nr[1001],y,x,sum,s[1001];
int main (){
fin>>n>>m;
mini=100;
for(i=1;i<=n;i++)
fin>>v[i];
for(j=1;j<=m;j++){
fin>>ci[j]>>t[j]>>nr[j];
for(k=1;k<=nr[j];k++)
fin>>s[k];
}
for(i=1;i<=n;i++){
p++;
sc[p]=v[i];
}
for(o=1;o<=m+1;o++){
for(j=1;j<=m;j++){
if(j!=y){
sum=sum+t[j];
for(k=1;k<=nr[j];k++){
x=s[k];
if(sc[x]==0)
sc[x]=1;
else
sc[x]=0;
}
}
}
for(i=1;i<=n;i++)
if(sc[i]==1)
unu++;
if(unu==maxi)
if(sum<mini)
mini=sum;
if(unu>maxi)
maxi=unu;
sum=0;
for(i=1;i<=n;i++)
sc[i]=v[i];
y++;
unu=0;
}
fout<<mini;
return 0;
}