Cod sursa(job #122743)

Utilizator katakunaCazacu Alexandru katakuna Data 13 ianuarie 2008 16:49:16
Problema Elimin Scor 50
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.13 kb
#include<stdio.h>

int max,v[301],unu,su,s[301],ok,x,a[301][301],n,m,r,c,i,j,k,l;

int main(){

FILE *f=fopen("elimin.in","r");
fscanf(f,"%d%d%d%d",&n,&m,&r,&c);
   for(i=1;i<=n;i++){
      for(j=1;j<=m;j++){
      fscanf(f,"%d",&a[i][j]);
      }
   }

fclose(f);

 for(i=0;i<=(1<<n)-1;i++){

 unu=0;
    for(j=n-1;j>=0;j--){
    v[j+1]=(i>>j)&1;
    if(v[j+1]==1)unu++;
    }

   if(unu==r){
    su=0;

     for(k=1;k<=m;k++){
     s[k]=0;
     }

       for(l=1;l<=n;l++){
	 if(v[l]==1){
	 // for(k=1;k<=m;k++){
	  //b[l][k]=0;
	  //}
	 }
	 else{
	   for(k=1;k<=m;k++){
	   s[k]+=a[l][k];
	   su+=a[l][k];
	   }
	 }

       }


    // for(l=1;l<=m;l++){
    // s[l]=0;
      //	for(k=1;k<=n;k++){
      //	s[l]+=b[k][l];
       //	}
    //  su+=s[l];

  //   }


     ok=1;

     while(ok){
     ok=0;
      for(l=1;l<m;l++){

	if(s[l]>s[l+1]){
	x=s[l];
	s[l]=s[l+1];
	s[l+1]=x;
	ok=1;
	}

      }
     }


     for(l=1;l<=c;l++){
     su-=s[l];
     }

   if(su>max)max=su;

   }

 }

FILE *g=fopen("elimin.out","w");
fprintf(f,"%d",max);
fclose(g);

return 0;
}