Робот и платформы

import sys
 
def solve() -> None:
    data = sys.stdin.read().strip().split()
    if not data:
        return
    it = iter(data)
    n = int(next(it))
    m = int(next(it))
    eras = []
    for _ in range(n):
        row = [int(next(it)) for _ in range(m)]
        row.sort()
        eras.append(row)
    dp = [0] * n
    choice = [-1] * n
    for i in range(1, n):
        best = 10 ** 20
        best_idx = -1
        for j in range(m):
            cand = abs(eras[i][j] - eras[i - 1][0])
            if cand < best or (cand == best and eras[i][j] < eras[i][best_idx]):
                best = cand
                best_idx = j
        dp[i] = dp[i - 1] + best
        choice[i] = best_idx
    path = [0] * n
    path[n - 1] = choice[n - 1]
    for i in range(n - 2, -1, -1):
        path[i] = 0
    result = [eras[i][path[i]] for i in range(n)]
    sys.stdout.write(" ".join(map(str, result)))
 
if __name__ == "__main__":
    solve()