Pagini recente » Cod sursa (job #2415345) | Rating Cazan Marius (CazanMarius) | Cod sursa (job #1494798) | Cod sursa (job #910828) | Cod sursa (job #402575)
Cod sursa(job #402575)
# include <fstream.h>
using namespace std;
ifstream f ("elimin.in");
ofstream g ("elimin.out");
int a[100][100],b[100],i,j,aux,smax=-10000,q,w,n,m,s[100],sf,z,k,kk;
void xyz ()
{int i,j;
sf=0;
for (k=1;k<=m;k++)
{z=0;
for (j=1;j<=n;j++)
z=z+a[j][k];
for (j=1;j<=q;j++)
z=z-a[b[j]][k];
sf=sf+z;
s[k]=z;
}
sort (s+1,s+m+1);
for (i=1;i<=w;i++)
sf=sf-s[i];
if (smax<sf)
smax=sf;
}
void back (int i)
{
int val;
for (val=b[i-1]+1;val<=n;val++)
{
b[i]=val;
if (i==q)
xyz ();
if (i<q)
back (i+1);
}
}
int main ()
{
f>>n>>m>>q>>w;
for (i=1;i<=n;i++)
for (j=1;j<=m;j++)
f>>a[i][j];
back (1);
g<<smax;
}