Pagini recente » Cod sursa (job #1089020) | Cod sursa (job #1391140) | Cod sursa (job #2851538) | Cod sursa (job #1354235) | Cod sursa (job #681377)
Cod sursa(job #681377)
using namespace std;
#include<cstdio>
#define Max 20
int a[Max][Max];
long long St;
int main()
{
int i,j,n,m,S,Sm;
freopen("flip.in","r",stdin);
freopen("flip.out","w",stdout);
scanf("%d %d",&n,&m);
St=0;
for(i=1;i<=n;i++)
{
S=0; Sm=0;
for(j=1;j<=m;j++)
{
scanf("%d",&a[i][j]);
S=S+a[i][j];
Sm=Sm-a[i][j];
}
if(Sm>S)
for(j=1;j<=m;j++)
a[i][j]=-a[i][j];
}
for(j=1;j<=m;j++)
{
S=0; Sm=0;
for(i=1;i<=n;i++)
{
S=S+a[i][j];
Sm=Sm-a[i][j];
}
if(Sm>S)
St=St+Sm;
else
St=St+S;
}
printf("%lld",St);
return 0;
}