#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, m;
ll dpx[1001], dpy[1001], dpz[1001], x[1001], y[1001], z[1001];
int main(){
    scanf("%d%d", &n, &m);
    for(int i=1; i<=n; i++)scanf("%lld%lld%lld", &x[i], &y[i], &z[i]);
    for(int i=1; i<=n; i++){
        for(int j=m; j>=1; j--){
            if(abs(dpx[j]) + abs(dpy[j]) + abs(dpz[j]) < abs(dpx[j-1]+x[i]) + abs(dpy[j-1]+y[i]) + abs(dpz[j-1]+z[i]))
                dpx[j] = dpx[j-1] + x[i], dpy[j] = dpy[j-1] + y[i], dpz[j] = dpz[j-1] + z[i];
        }
    }printf("%lld\n", abs(dpx[m]) + abs(dpy[m]) + abs(dpz[m]));
    return 0;
}

如题