Pagini recente » Giuco | Cod sursa (job #432883) | Monitorul de evaluare | Cod sursa (job #2510193) | Cod sursa (job #2005791)
#include <iostream>
#include<vector>
#include <cmath>
#include <fstream>
using namespace std;
int main()
{
ifstream fin("flip.in");
ofstream fout("flip.out");
int n, m,k;
fin>>n>>m;
vector<int>aux(m,0);
vector<vector<int>>v(n,aux);
for(int i=0; i<n; i++){
for(int j=0; j<m; j++){
fin>>k;
v[i].push_back(k);
}
}
int suma1=0;
int suma2=0;
for(int i=0; i<v.size();i++){
for(int j=0; j<v[0].size();j++){
if(v[i][j]>0){
suma1+=v[i][j];
}
else{
suma2+=abs(v[i][j]);
}
}
}
fout<<max(suma1,suma2);
return 0;
}