Pagini recente » Cod sursa (job #705531) | Istoria paginii runda/oni222 | Cod sursa (job #709784) | Cod sursa (job #1316345) | Cod sursa (job #2702345)
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("flip.in");
ofstream fout("flip.out");
long long int l[1000001],c[1000001],L[1000001],C[1000001];
int main()
{
int N,M;
long long int s=0;
long long int m[20][20];
fin>>N;
fin>>M;
for(int i=1;i<=N;i++)
{
for(int j=1;j<=M;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<=N;i++)
{
s=s+max(l[i],L[i]);
}
for(int i=1;i<=M;i++)
{
s=s+max(c[i],C[i]);
}
fout<<s;
return 0;
}