Pagini recente » Cod sursa (job #200528) | Cod sursa (job #1371880) | Cod sursa (job #1522170) | Cod sursa (job #2227992) | Cod sursa (job #3409)
Cod sursa(job #3409)
#include <fstream>
using namespace std;
#define MAX 16
long long int a[MAX][MAX];
int n, m;
long long int inm[MAX], neinm[MAX], sum;
long long int dez[MAX], imb[MAX];
void Read();
void Write();
void Solve();
int main()
{
Read();
Solve();
Write();
return 0;
}
void Read()
{
ifstream fin ("flip.in");
fin >> n >> m;
for ( int i = 1; i <= n; i ++)
for ( int j = 1; j <= m; j++)
fin >> a[i][j];
fin.close();
}
void Solve()
{
for ( int i = 1; i <= n; i++)
{
for ( int j = 1; j <= m; j++)
{
neinm[i] += a[i][j];
inm[i] += (-1)*a[i][j];
}
if ( neinm[i] < inm[i] )
{
for ( int j = 1; j <= m; j++)
a[i][j] = -a[i][j];
}
}
for ( int j = 1; j <= m; j++)
{
for ( int i = 1; i <= n; i++)
{
dez[j] += a[i][j];
imb[j] += (-1)*a[i][j];
}
if ( dez[j] < imb[j] )
dez[j] = imb[j];
sum += dez[j];
}
}
void Write()
{
ofstream fout ("flip.out");
fout << sum;
fout.close();
}