abc100d<枚举>

#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
using LL = long long;
const int N = 1010;
LL w[N][3];

void solv()
{
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= n; i ++)
    {
        for (int j = 0; j < 3; j ++)
            cin >> w[i][j];
    }

    LL ans = 0;
    // 枚举三个权重的正负情况，一共2^3种可能
    for (int i = 0; i < 8; i ++)
    {
        // 得到当前组的正负情况
        LL sel[3];
        for (int j = 0; j < 3; j ++)
            sel[j] = (i >> j & 1) ? 1 : -1;

        // 根据正负情况，计算每个蛋糕的分数
        vector<LL> tmp;
        LL score;
        for (int j = 1; j <= n; j ++)
        {
            score = 0;
            for (int k = 0; k < 3; k ++)
                score += sel[k] * w[j][k];
            tmp.push_back(score);
        }

        // 按得分降序排序，取前m个
        sort(tmp.begin(), tmp.end(), greater<LL>());
        score = 0;
        for (int j = 0; j < m; j ++) 
            score += tmp[j];

        ans = max(ans, score);
    }

    cout << ans << '\n';
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int T = 1;
    // cin >> T;
    while (T--)
        solv();
    return 0;
}