Submission #2694979


Source Code Expand

p=input
n,m=map(int,p().split())
l=[p().split()for _ in[0]*n]
print(max([sum(sorted([sum([int(x[i])*[1,-1][k>>i&1]for i in range(3)])for x in l])[::-1][:m])for k in range(8)]))

Submission Info

Submission Time
Task D - Patisserie ABC
User yumechi
Language Python (3.4.3)
Score 400
Code Size 179 Byte
Status AC
Exec Time 39 ms
Memory 3444 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 4
AC × 20
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt
All in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt
Case Name Status Exec Time Memory
in01.txt AC 38 ms 3444 KB
in02.txt AC 38 ms 3444 KB
in03.txt AC 38 ms 3444 KB
in04.txt AC 38 ms 3444 KB
in05.txt AC 39 ms 3444 KB
in06.txt AC 37 ms 3444 KB
in07.txt AC 37 ms 3444 KB
in08.txt AC 35 ms 3188 KB
in09.txt AC 34 ms 3188 KB
in10.txt AC 34 ms 3188 KB
in11.txt AC 38 ms 3444 KB
in12.txt AC 35 ms 3444 KB
in13.txt AC 33 ms 3316 KB
in14.txt AC 33 ms 3316 KB
in15.txt AC 33 ms 3316 KB
in16.txt AC 34 ms 3316 KB
sample_01.txt AC 17 ms 3060 KB
sample_02.txt AC 17 ms 3060 KB
sample_03.txt AC 17 ms 3060 KB
sample_04.txt AC 17 ms 3060 KB