Pagini recente » Cod sursa (job #2419871) | Cod sursa (job #554179) | Cod sursa (job #2427548) | Cod sursa (job #1756063) | Cod sursa (job #583056)
Cod sursa(job #583056)
#include<cstdio>
int n, m, a[1000][1000], s1[1000], s2[1000],i, j, minim1, minim2, p1, p2, s;
int main()
{
freopen("flip.in", "r", stdin);
freopen("flip.out", "w", stdout);
scanf("%d %d", &n, &m);
for(i=1; i<=n; ++i)
for(j=1; j<=m; ++j) { scanf("%d", &a[i][j]);
s1[i]+=a[i][j];
s2[j]+=a[i][j];
}
minim1=s1[1];
minim2=s2[1];
for(i=2; i<=n; ++i) if(s1[i]<minim1) { minim1=s1[i];
p1=i;
}
for(i=2; i<=m; ++i) if(s2[i]<minim2) { minim2=s2[i];
p2=i;
}
for(i=1; i<=m; ++i) a[p1][i]=-a[p1][i];
for(i=1; i<=n; ++i) a[i][p2]=-a[i][p2];
for(i=1; i<=n; ++i)
for(j=1; j<=m; ++j) s+=a[i][j];
printf("%d ", s);/*
for(i=1; i<=n; ++i) printf("%d ", s1[i]);
printf("\n");
for(i=1; i<=m; ++i) printf("%d ", s2[i]);
printf("\n%d %d\n", minim1, minim2);
printf("%d %d\n", p1, p2);
*/
fclose(stdin);
fclose(stdout);
return 0;
}