Fault-tolerant Network
There is a classroom with two rows of computers. There are $$$n$$$ computers in each row and each computer has its own grade. Computers in the first row has grades $$$a_1, a_2, \dots, a_n$$$ and in the second row — $$$b_1, b_2, \dots, b_n$$$.Initially, all pairs of neighboring computers in each row are connected by wire (pairs $$$(i, i + 1)$$$ for all $$$1 \le i < n$$$), so two rows form two independent computer networks.Your task is to combine them in one common network by connecting one or more pairs of computers from different rows. Connecting the $$$i$$$-th computer from the first row and the $$$j$$$-th computer from the second row costs $$$|a_i - b_j|$$$.You can connect one computer to several other computers, but you need to provide at least a basic fault tolerance: you need to connect computers in such a way that the network stays connected, despite one of its computer failing. In other words, if one computer is broken (no matter which one), the network won't split in two or more parts.That is the minimum total cost to make a fault-tolerant network?
In the first test case, it's optimal to connect four pairs of computers:   computer $$$1$$$ from the first row with computer $$$2$$$ from the second row: cost $$$|1 - 4| = 3$$$;  computer $$$3$$$ from the first row with computer $$$2$$$ from the second row: cost $$$|1 - 4| = 3$$$;  computer $$$2$$$ from the first row with computer $$$1$$$ from the second row: cost $$$|10 - 20| = 10$$$;  computer $$$2$$$ from the first row with computer $$$3$$$ from the second row: cost $$$|10 - 25| = 15$$$;  In total, $$$3 + 3 + 10 + 15 = 31$$$.In the second test case, it's optimal to connect $$$1$$$ from the first row with $$$1$$$ from the second row, and $$$4$$$ from the first row with $$$4$$$ from the second row.
The first line contains a single integer $$$t$$$ ($$$1 \le t \le 10^4$$$) — the number of test cases. Next $$$t$$$ cases follow.The first line of each test case contains the single integer $$$n$$$ ($$$3 \le n \le 2 \cdot 10^5$$$) — the number of computers in each row.The second line contains $$$n$$$ integers $$$a_1, a_2, \dots, a_n$$$ ($$$1 \le a_i \le 10^9$$$) — the grades of computers in the first row.The third line contains $$$n$$$ integers $$$b_1, b_2, \dots, b_n$$$ ($$$1 \le b_i \le 10^9$$$) — the grades of computers in the second row.It's guaranteed that the total sum of $$$n$$$ doesn't exceed $$$2 \cdot 10^5$$$.
For each test case, print a single integer — the minimum total cost to make a fault-tolerant network.
from bisect import bisect_right

def helper(ele, l1):
    ind = bisect_right(l1, ele)
    if ind == len(l1):
        return abs(l1[ind - 1] - ele)
    elif ind == 0:
        return abs(l1[0] - ele)
    else:
        return min(abs(l1[ind - 1] - ele), abs(l1[ind] - ele))
for _ in range(int(input())):
    n = int(input())
    a = [int(i) for i in input().split()]
    (a0, a1) = (a[0], a[n - 1])
    b = [int(i) for i in input().split()]
    (b0, b1) = (b[0], b[n - 1])
    a.sort()
    b.sort()
    (c1, c2, c3, c4) = (helper(a0, b), helper(a1, b), helper(b0, a), helper(b1, a))
    ans = min(abs(a0 - b0) + abs(b1 - a1), abs(a1 - b0) + abs(a0 - b1))
    ans = min(ans, abs(a0 - b0) + c2 + c4)
    ans = min(ans, abs(a0 - b1) + c2 + c3)
    ans = min(ans, abs(a1 - b1) + c1 + c3)
    ans = min(ans, abs(a1 - b0) + c1 + c4)
    ans = min(ans, c1 + c4 + c2 + c3)
    print(ans)
import sys
input = sys.stdin.readline

def solve(n, A, B):
    ans = min(abs(A[0] - B[0]) + abs(A[-1] - B[-1]), abs(A[0] - B[-1]) + abs(A[-1] - B[0]))
    (minA1, minB1) = (min([abs(A[0] - b) for b in B]), min([abs(a - B[0]) for a in A]))
    (minA2, minB2) = (min([abs(A[-1] - b) for b in B]), min([abs(a - B[-1]) for a in A]))
    ans = min(ans, abs(A[0] - B[0]) + minA2 + minB2)
    ans = min(ans, abs(A[-1] - B[-1]) + minA1 + minB1)
    ans = min(ans, abs(A[0] - B[-1]) + minB1 + minA2)
    ans = min(ans, abs(A[-1] - B[0]) + minB2 + minA1)
    ans = min(ans, minA1 + minB1 + minA2 + minB2)
    print(ans)
for _ in range(int(input())):
    n = int(input())
    A = list(map(int, input().split()))
    B = list(map(int, input().split()))
    solve(n, A, B)
def solve_problem():
    for _ in range(int(input())):
        _ = input()
        row1 = input().split()
        r10 = int(row1[0])
        r11 = int(row1[-1])
        row2 = input().split()
        r20 = int(row2[0])
        r21 = int(row2[-1])
        left1 = 5000000000
        right1 = 5000000000
        left2 = 5000000000
        right2 = 5000000000
        for i in row1:
            val = int(i)
            tmp1 = abs(r20 - val)
            if tmp1 < left2:
                left2 = tmp1
            tmp2 = abs(r21 - val)
            if tmp2 < right2:
                right2 = tmp2
        for i in row2:
            val = int(i)
            tmp3 = abs(r10 - val)
            if tmp3 < left1:
                left1 = tmp3
            tmp4 = abs(r11 - val)
            if tmp4 < right1:
                right1 = tmp4
        diff0 = abs(r10 - r20)
        diff1 = abs(r11 - r21)
        left = left1 + left2
        right = right1 + right2
        res = left + right
        excep1 = diff0 + diff1
        if excep1 < res:
            res = excep1
        excep2 = diff0 + right
        if excep2 < res:
            res = excep2
        excep3 = abs(r10 - r21) + left2 + right1
        if excep3 < res:
            res = excep3
        excep4 = diff1 + left
        if excep4 < res:
            res = excep4
        excep5 = abs(r11 - r20) + left1 + right2
        if excep5 < res:
            res = excep5
        excep6 = abs(r10 - r21) + abs(r11 - r20)
        if excep6 < res:
            res = excep6
        print(res)
solve_problem()