Submission #2681271

---

Source Code Expand

from itertools import product

n, m = map(int, input().split())

xyzs = [[int(x) for x in input().split()] for _ in range(n)]

multipliers = product((-1, 1), repeat=3)

def max_sum(multiplier):
    sums = (sum(a*mul for a, mul in zip(xyz, multiplier)) for xyz in xyzs)
    top_m = sorted(sums, reverse=True)[:m]
    return sum(top_m)

print(max(max_sum(multiplier) for multiplier  in multipliers))

Submission Info

Judge Result