Submission #2857457

---

Source Code Expand

#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
ll n, m, x, y, z, a[10][1100], res;
int main(void){
    // Your code here!
    cin >> n >> m;
    for (ll i = 0; i < n; i++) {
        cin >> x >> y >> z;
        for (ll j = 0; j < 2; j++) {
            for (ll k = 0; k < 2; k++) {
                for (ll l = 0; l < 2; l++) {
                    a[j * 4 + k * 2 + l][i] = x * (j ? 1 : -1) + y * (k ? 1 : -1) + z * (l ? 1 : -1);
                }
            }
        }
    }
    for (ll i = 0; i < 8; i++) {
        sort(a[i] , a[i] + n);
        reverse(a[i], a[i] + n);
    }
    for (ll i = 0; i < 8; i++) {
        ll ans = 0;
        for (ll j = 0; j < m; j++) {
            if (a[i][j] <= 0) break;
            ans += a[i][j];
        }
        res = max(res, ans);
    }
    cout << res << endl;
}

Submission Info

Judge Result