Pagini recente » Cod sursa (job #2689191) | Cod sursa (job #288371) | Cod sursa (job #414462) | Cod sursa (job #1983245) | Cod sursa (job #2854896)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("flip.in");
ofstream out("flip.out");
int main(){
int n, m;
in >> n >> m;
int totalSum = 0;
int sum;
int minn;
int x[n][m];
for (int i = 0; i < n; ++i){
sum = 0;
minn = INT_MAX;
for (int j = 0; j < m; ++j){
in >> x[i][j];
if (x[i][j] < 0){
x[i][j] *= (-1);
}
sum += x[i][j];
if (minn > x[i][j]){
minn = x[i][j];
}
}
totalSum += sum + 2 * (-minn);
}
out << totalSum;
return 0;
}