Pagini recente » Cod sursa (job #999664) | Cod sursa (job #1275176) | Rating Radu Cioata (iRadu_) | Cod sursa (job #2007148) | Cod sursa (job #2702343)
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("flip.in");
ofstream fout("flip.out");
long long int l[100001],c[100001],L[100001],C[100001];
int main()
{
int a,b;
long long int s=0;
long long int m[20][20];
fin>>a;
fin>>b;
for(int i=1;i<=a;i++)
{
for(int j=1;j<=b;j++)
{
fin>>m[i][j];
l[i]=l[i]+m[i][j];
c[j]=c[j]+m[i][j];
L[i]=L[i]+(-1)*m[i][j];
C[j]=C[j]+(-1)*m[i][j];
}
}
for(int i=1;i<=a;i++)
{
s=s+max(l[i],L[i]);
}
for(int i=1;i<=b;i++)
{
s=s+max(c[i],C[i]);
}
fout<<s;
return 0;
}