Submission

Status:

PPPPPPPPPP

Subtask/Task Score:

100/100

Score: 100

User: Him123

Problemset: สูงต่ำในตาราง

Language: python

Time: 0.011 second

Submitted On: 2026-09-19 13:06:26

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

maximum = []
minimum = []

for i in range(n):
    row = list(map(int,input().split()))
    maximum.append(max(row))
    minimum.append(min(row))
answer = 0

for i in range(n):
    answer = max(answer, maximum[i] - minimum[i])
for i in range(n):
    for j in range(n):
        if i != j:
            x = maximum[i] - minimum[j] + 2 * b
            answer = max(answer, x)
print(answer)