Pagini recente » Cod sursa (job #2843339) | Cod sursa (job #1365396) | Cod sursa (job #2663399) | Cod sursa (job #2865634) | Cod sursa (job #23244)
Cod sursa(job #23244)
#include<iostream.h>
#include<fstream.h>
unsigned int n,m,r,h,c,i,j,a[100][100],min,s,k;
int main()
{ifstream f("elimin.in");
ofstream g("elimin.out");
f>>m>>n>>r>>c;
for(i=1;i<=m;i++)
for(j=1;j<=n;j++)
f>>a[i][j];
for(i=1;i<=r;i++)
{min=32000;
for(j=1;j<=m;j++)
{s=0;
for(k=1;k<=n;k++)
s=s+a[j][k];
if(min>s)
{min=s;h=j;}
}
if(h==m)
m--;
else
{while(h<m)
{for(k=1;k<=n;k++)
{a[h][k]=a[h+1][k];
}
h++;}
m--;}
}
for(i=1;i<=c;i++)
{min=32000;
for(j=1;j<=n;j++)
{s=0;
for(k=1;k<=m;k++)
s=s+a[k][j];
if(min>s)
{min=s;h=j;}
}
if(h==n)
n--;
else
{while(h<n)
{for(k=1;k<=m;k++)
{a[k][h]=a[k][h+1];
}
h++;}
n--;}
}
s=0;
for(i=1;i<=m;i++)
for(j=1;j<=n;j++)
s=s+a[i][j];
g<<s;
f.close();g.close();
return 0;
}