Pagini recente » Cod sursa (job #2759695) | Cod sursa (job #2426553) | Clasamentul arhivei de probleme | Cod sursa (job #2759586) | Cod sursa (job #2825377)
#include "bits/stdc++.h"
using namespace std;
#define ll long long
#define forn(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(),v.rend()
#define pb push_back
#define sz(a) (int)a.size()
void solve()
{
int n, m;
cin >> n >> m;
ll c[n][m];
for(int i = 0;i < n ;++i){
for(int j = 0;j < m; ++j){
cin >> c[i][j];
}
}
ll ans = 0;
for(int mask = 0;mask < (1 << n); ++mask){
ll now = 0;
for(int i = 0;i < m; ++i){
ll a = 0, b = 0;
for(int j = 0;j < n; ++j){
if(mask & (1 << j)){
a += c[j][i], b += -c[j][i];
}else{
a += -c[j][i], b += c[j][i];
}
}
now += max(a, b);
}
ans = max(ans, now);
}
cout << ans;
}
int32_t main(){
freopen("flip.in", "r", stdin);
freopen("flip.out", "w", stdout);
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int t = 1;
//cin >> t;
while(t--)
{
solve();
}
}