Pagini recente » Cod sursa (job #440190) | Cod sursa (job #20312) | Cod sursa (job #1561483) | Cod sursa (job #635969) | Cod sursa (job #2029953)
#include <iostream>
#include <cstdio>
#include <limits.h>
using namespace std;
int c_min (int a[][20], int n, int m){
int mi=INT_MAX, c;
for (int j=1; j<=m; j++){
int sum=0;
for (int i=1; i<=n; i++)
sum+=a[i][j];
if (sum < mi){
mi=sum;
c=j;
}
}
return c;
}
int l_min (int a[][20], int n, int m){
int mi=INT_MAX, l;
for (int j=1; j<=n; j++){
int sum=0;
for (int i=1; i<=m; i++)
sum+=a[j][i];
if (sum < mi){
mi=sum;
l=j;
}
}
return l;
}
int main()
{
freopen("flip.in","r",stdin);
freopen("flip.out","w",stdout);
int a[20][20],n,m,i,j, su=0;
cin>>n>>m;
for (i=1; i<=n; i++)
for (j=1; j<=m; j++)
cin>>a[i][j];
int col_m=c_min(a,n,m), lin_m=l_min(a,n,m);
for (i=1; i<=n; i++)
for (j=1; j<=m; j++)
if (j==col_m || i==lin_m)
su+=a[i][j]*(-1);
else su+=a[i][j];
cout<<su;
return 0;
}