You are viewing a single comment's thread. Return to all comments →
Surprisingly pass with O(n^4) solution.
Read triangular(N) input.
Compute all tetrahedral(N) subtriangles in O(n^3).
Each subtriangle cost O(n). Could be O(1) by subtracting pre-computed row of sum.
Sort all subtriangles and print first K.