Submission #2857516

---

Source Code Expand

#include <iostream>
#include <climits>
#include <algorithm>

#define LL long long
#define INF LONG_LONG_MAX
#define MAXN 100

LL a[MAXN + 1], b[MAXN + 1], c[MAXN + 1], v[8][MAXN + 1];


LL abs(LL n) {
    if (n < 0)
        return -n;
    return n;
}


int main()
{
    int n, m;
    std::cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        std::cin >> a[i] >> b[i] >> c[i];
        for (int j = 0; j <= 1; j++)
            for (int k = 0; k <= 1; k++)
                for (int l = 0; l <= 1; l++) {
                    v[4 * l + 2 * k + j][i] = (2 * j - 1) * a[i] + (2 * k - 1) * b[i] + (2 * l - 1) * c[i];
                }
    }
    for (int i = 0; i < 8; i++)
        std::sort(v[i], v[i] + n);
    LL max = -INF + 2;
    for (int i = 0; i < 8; i++) {
        LL s = 0;
        for (int j = n; j >= n - m + 1; j--)
            s += v[i][j];
        if (s > max)
            max = s;
    }
    std::cout << max;
}

Submission Info

Judge Result