Problem:
 Score : 500 points    Problem Statement There are N integers X_1, X_2, \cdots, X_N , and we know that A_i \leq X_i \leq B_i .
Find the number of different values that the median of X_1, X_2, \cdots, X_N can take.      Notes The median of X_1, X_2, \cdots, X_N is defined as follows. Let x_1, x_2, \cdots, x_N be the result of sorting X_1, X_2, \cdots, X_N in ascending order.   If N is odd, the median is x_{(N+1)/2} ;  if N is even, the median is (x_{N/2} + x_{N/2+1}) / 2 .       Constraints  2 \leq N \leq 2 \times 10^5  1 \leq A_i \leq B_i \leq 10^9  All values in input are integers.         Input Input is given from Standard Input in the following format:  N  A_1  B_1  A_2  B_2  :  A_N  B_N       Output Print the answer.        Sample Input 1 2
1 2
2 3      Sample Output 1 3    If X_1 = 1 and X_2 = 2 , the median is \frac{3}{2} ;    if X_1 = 1 and X_2 = 3 , the median is 2 ;    if X_1 = 2 and X_2 = 2 , the median is 2 ;    if X_1 = 2 and X_2 = 3 , the median is \frac{5}{2} .    Thus, the median can take three values: \frac{3}{2} , 2 , and \frac{5}{2} .       Sample Input 2 3
100 100
10 10000
1 1000000000      Sample Output 2 9991

Solution (Python):
def main():
    n = int(input())
    ranges = [[int(x) for x in input().split()] for _ in range(n)]

    mins = []
    maxs = []
    for a, b in ranges:
        mins.append(a)
        maxs.append(b)
    mins.sort()
    maxs.sort()
    if n % 2 == 0:
        min_mid = mins[n // 2 - 1] + mins[n // 2]
        max_mid = maxs[n // 2 - 1] + maxs[n // 2]
        ans = max_mid - min_mid + 1
    else:
        min_mid = mins[(n + 1) // 2 - 1]
        max_mid = maxs[(n + 1) // 2 - 1]
        ans = max_mid - min_mid + 1
    print(ans)


if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
a_ = [0]*n
b_ = [0]*n
c = [0]*n
for i in range(n):
    a_[i],b_[i] = map(int,input().split())
    c[i] = a_[i]
lb_ = 1
ub_ = 10**9
c.sort()
med = c[(n-1)//2]
med_ub = c[(n-1)//2+1]


def ok_odd(m):
    cnt = 0
    for i in range(n):
        a = a_[i]
        if a <= m:
            cnt += 1
    if cnt < (n+1)//2:
        return False
    cnt = 0
    for i in range(n):
        b = b_[i]
        if b >= m:
            cnt += 1
    if cnt < (n+1)//2:
        return False
    cnt = 0
    for i in range(n):
        a,b = a_[i],b_[i]
        if a <= m and m <= b:
            return True
    return False

def ok_even_lb(m):
    cnt = 0
    for i in range(n):
        a = a_[i]
        if a <= m:
            cnt += 1
    if cnt < n//2:
        return False
    cnt = 0
    for i in range(n):
        b = b_[i]
        if b >= m:
            cnt += 1
    if cnt < n//2 + 1:
        return False
    cnt = 0
    for i in range(n):
        a,b = a_[i],b_[i]
        if a <= m and m <= b:
            return True
    return False

def ok_even_ub(m):
    cnt = 0
    for i in range(n):
        a = a_[i]
        if a <= m:
            cnt += 1
    if cnt < n//2 + 1:
        return False
    cnt = 0
    for i in range(n):
        b = b_[i]
        if b >= m:
            cnt += 1
    if cnt < n//2:
        return False
    cnt = 0
    for i in range(n):
        a,b = a_[i],b_[i]
        if a <= m and m <= b:
            return True
    return False

if n % 2 == 1:
    lb = 1
    ub = med
    while lb < ub:
        mid = (lb+ub)//2
        if ok_odd(mid):
            ub = mid
        else:
            lb = mid+1
    lb_ret = lb
    lb = med
    ub = 10**9
    while lb < ub:
        mid = (lb+ub+1)//2
        if ok_odd(mid):
            lb = mid
        else:
            ub = mid-1
    ub_ret = lb
    print(ub_ret-lb_ret+1)
else:
    lb = 1
    ub = med
    while lb < ub:
        mid = (lb+ub)//2
        if ok_even_lb(mid):
            ub = mid
        else:
            lb = mid+1
    lb_lb = lb
    lb = med
    ub = 10**9
    while lb < ub:
        mid = (lb+ub+1)//2
        if ok_even_lb(mid):
            lb = mid
        else:
            ub = mid-1
    lb_ub = lb

    lb = 1
    ub = med_ub
    while lb < ub:
        mid = (lb+ub)//2
        if ok_even_ub(mid):
            ub = mid
        else:
            lb = mid+1
    ub_lb = lb
    lb = med_ub
    ub = 10**9
    while lb < ub:
        mid = (lb+ub+1)//2
        if ok_even_ub(mid):
            lb = mid
        else:
            ub = mid-1
    ub_ub = lb
    print(ub_ub+lb_ub-lb_lb-ub_lb+1)

Solution (Python):
import sys
sys.setrecursionlimit(1 << 25)
read = sys.stdin.readline
ra = range
enu = enumerate


def mina(*argv, sub=1): return list(map(lambda x: x - sub, argv))



def read_a_int(): return int(read())


def read_ints(): return list(map(int, read().split()))


def read_col(H):
    '''H is number of rows
    A列、B列が与えられるようなとき
    ex1)A,B=read_col(H)    ex2) A,=read_col(H) 
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return tuple(map(list, zip(*ret)))


def read_tuple(H):
    '''H is number of rows'''
    ret = []
    for _ in range(H):
        ret.append(tuple(map(int, read().split())))
    return ret


def read_matrix(H):
    '''H is number of rows'''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return ret
    


MOD = 10**9 + 7
INF = 2**31  

from collections import defaultdict, Counter, deque
from operator import itemgetter
from itertools import product, permutations, combinations
from bisect import bisect_left, bisect_right  


class Compress:
    def __init__(self, ls):
        
        self.i_to_orig = sorted(set(ls))
        self.orig_to_i = {}
        for i, zahyou in enumerate(self.i_to_orig):
            self.orig_to_i[zahyou] = i
        self.len = len(self.i_to_orig)

    def __len__(self):
        return len(self.i_to_orig)


N = read_a_int()
A, B = read_col(N)
A.sort()
B.sort()
if N & 1:
    print(B[N // 2] - A[N // 2] + 1)
else:
    l = (A[N // 2 - 1] + A[N // 2])
    r = (B[N // 2] + B[N // 2 - 1])
    print(abs(r - l) + 1)

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(200000)
import bisect


def read():
    N = int(input().strip())
    AB = []
    for i in range(N):
        a, b = map(int, input().strip().split())
        AB.append((a, b))
    return N, AB


def solve(N, AB, MOD=1000000007):
    A = list(sorted([a for a, b in AB]))
    B = list(sorted([b for a, b in AB]))
    if N % 2 == 1:
        m = N // 2
        low = A[m]
        high = B[m]
        return high - low + 1
    else:
        m = N // 2
        low = A[m-1] + A[m]
        high = B[m-1] + B[m]
        return high - low + 1
    return -1


if __name__ == '__main__':
    inputs = read()
    outputs = solve(*inputs)
    if outputs is not None:
        print("%s" % str(outputs))

Solution (Python):
import statistics
N = int(input())
A = []
B = []
for _ in range(N):
  a, b = map(int, input().split())
  A.append(a)
  B.append(b)
left = statistics.median(A)
right = statistics.median(B)
if N%2 == 0:
  print(int(right*2 - left*2 + 1))
else: 
  print(right-left+1)

Solution (Python):
from statistics import median

N = int(input())
A = []
B = []
for _ in range(N):
    a, b = map(int, input().split())
    A.append(a)
    B.append(b)

m = median(A)
M = median(B)

if N % 2 == 0:
    m *= 2
    M *= 2

print(int(M-m+1))

Solution (Python):
N = int(input())
X = [list(map(int,input().split())) for _ in range(N)]

Y = sorted(X, key=lambda x:x[0])
Z = sorted(X, key=lambda x:x[1])

ans = 0
if N % 2:
    ans = Z[N//2][1]-Y[N//2][0]+1

else:
    ans = Z[N//2][1]-Y[N//2][0]+1
    ans += Z[N//2-1][1]-Y[N//2-1][0]

print(ans)

Solution (Python):
import statistics
num = int(input())
aList = []
bList = []
for x in range(num):
    a, b = map(int, input().split())
    aList.append(a)
    bList.append(b)
a_median = statistics.median(aList)
b_median = statistics.median(bList)
if num % 2 == 1: print(b_median - a_median + 1)
else: print(int((b_median - a_median) * 2) + 1)

Solution (Python):
def main(sample_file = ''):

    """ convenient functions
    
    
    
    
    
    """

    """convenient decorator
    
    
        
        
        
        
        
        
        
        
        
        
    """
    
    
    import sys
    sys.setrecursionlimit(10**7)
    from itertools import accumulate, combinations, permutations, product 
    
    from math import factorial, ceil, floor, sqrt
    def factorize(n):
        """return the factors of the Arg and count of each factor
        
        Args:
            n (long): number to be resolved into factors
        
        Returns:
            list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]
        """
        fct = []  
        b, e = 2, 0  
        while b * b <= n:
            while n % b == 0:
                n = n // b
                e = e + 1
            if e > 0:
                fct.append((b, e))
            b, e = b + 1, 0
        if n > 1:
            fct.append((n, 1))
        return fct
    def combinations_count(n, r):   
        """Return the number of selecting r pieces of items from n kinds of items.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        
        if n < 0 or r < 0:
            raise Exception('combinations_count(n, r) not defined when n or r is negative')
        if n - r < r: r = n - r
        if r < 0: return 0
        if r == 0: return 1
        if r == 1: return n
        numerator = [n - r + k + 1 for k in range(r)]
        denominator = [k + 1 for k in range(r)]
        for p in range(2,r+1):
            pivot = denominator[p - 1]
            if pivot > 1:
                offset = (n - r) % p
                for k in range(p-1,r,p):
                    numerator[k - offset] /= pivot
                    denominator[k] /= pivot
        result = 1
        for k in range(r):
            if numerator[k] > 1:
                result *= int(numerator[k])
        return result
    def combinations_with_replacement_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items allowing individual elements to be repeated more than once.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        if n < 0 or r < 0:
            raise Exception('combinations_with_replacement_count(n, r) not defined when n or r is negative')
        elif n == 0:
            return 1
        else:
            return combinations_count(n + r - 1, r)
    from bisect import bisect_left, bisect_right
    from collections import deque, Counter, defaultdict 
    from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest 
    from copy import deepcopy, copy 
    import operator
    from operator import itemgetter 
    
    
    from functools import reduce, lru_cache
    def chmin(x, y):
        """change minimum
        if x > y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current minimum value
            y (long): potential minimum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x > y:
            x = y
            return (x, True)
        else:
            return (x, False)
    def chmax(x, y):
        """change maximum
        if x < y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current maximum value
            y (long): potential maximum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x < y:
            x = y
            return (x, True)
        else:
            return (x, False)

    from fractions import gcd 
    def gcds(numbers):
        return reduce(gcd, numbers)
    def lcm(x, y):
        return (x * y) // gcd(x, y)
    def lcms(numbers):
        return reduce(lcm, numbers, 1)
    def make_divisors(n, reversed=False):
        """create list of divisors
        
        Args:
            number (int): number from which list of divisors is created
            reversed (bool, optional): ascending order if False. Defaults to False.
        
        Returns:
            list: list of divisors
        """
        divisors = set()
        for i in range(1, int(n**0.5)+1):
            if n % i == 0:
                divisors.add(i)
                divisors.add(n//i)
        return sorted(list(divisors),reverse=reversed)
    
    
    
    INF = 10 ** 18
    MOD = 10 ** 9 + 7
    AtoZ = list('abcdefghijklmnopqrsruvwxyz') 
    modpow = lambda a, n, p = MOD: pow(a, n, p) 
    def modinv(a, p = MOD):
        
        
        return modpow(a, p-2, p)
    def modinv_list(n, p = MOD):
        if n <= 1:
            return [0,1][:n+1]
        else:
            inv_t = [0,1]
            for i in range(2, n+1):
                inv_t += [inv_t[p % i] * (p - int(p / i)) % p]
            return inv_t
    def modfactorial_list(n, p = MOD):
        if n == 0:
            return [1]
        else:
            l = [0] * (n+1)
            tmp = 1
            for i in range(1, n+1):
                tmp = tmp * i % p
                l[i] = tmp
            return l
    def modcomb(n, k, fac_list = [], p = MOD):
        
        
        from math import factorial
        if n < 0 or k < 0 or n < k: return 0
        if n == 0 or k == 0: return 1
        if len(fac_list) <= n:
            a = factorial(n) % p
            b = factorial(k) % p
            c = factorial(n-k) % p
        else:
            a = fac_list[n]
            b = fac_list[k]
            c = fac_list[n-k]
        return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p
    def modadd(a, b, p = MOD):
        return (a + b) % MOD
    def modsub(a, b, p = MOD):
        return (a - b) % p
    def modmul(a, b, p = MOD):
        return ((a % p) * (b % p)) % p
    def moddiv(a, b, p = MOD):
        return modmul(a, modpow(b, p-2, p))

    class UnionFindTree:
        """union find tree class
        TODO: fix this description...
        how to use (example):
        >>  uf = UnionFindTree(N) 
        >>  if uf.find_root(a) == uf.find_root(b):
        >>      do something
        >>  else:
        >>      do something
        >>      uf.unite(a, b)
        """
        def __init__(self, N):
            self.root = [-1] * (N+1)
            self.rank   = [0]  * (N+1)
            self.connected_num = [1] * (N+1)
    
        def find_root(self,x):
            root = self.root
            while root[x] != -1:
                x = root[x]
            return x
    
        def unite(self,x,y):
            root = self.root
            rank = self.rank
            connected_num = self.connected_num
            find_root = self.find_root
    
            rx = find_root(x)
            ry = find_root(y)
            if rx != ry:
                if rank[rx] < rank[ry]:
                    root[rx] = ry
                    rx,ry = ry,rx
                else:
                    if rank[rx] == rank[ry]:
                        rank[rx] += 1
                    root[ry] = rx       
                connected_num[rx] += connected_num[ry]

    class SegTree:
        """
        ref: https://qiita.com/takayg1/items/c811bd07c21923d7ec69
        init(init_val, ide_ele): 配列init_valで初期化 O(N)
        update(k, x): k番目の値をxに更新 O(logN)
        query(l, r): 区間[l, r)をsegfuncしたものを返す O(logN)
        """
        def __init__(self, init_val, segfunc, ide_ele):
            """
            init_val: 配列の初期値
            segfunc: 区間にしたい操作
            ide_ele: 単位元
            n: 要素数
            num: n以上の最小の2のべき乗
            tree: セグメント木(1-index)
            """
            n = len(init_val)
            self.segfunc = segfunc
            self.ide_ele = ide_ele
            self.num = 1 << (n - 1).bit_length()
            self.tree = [ide_ele] * 2 * self.num
            
            for i in range(n):
                self.tree[self.num + i] = init_val[i]
            
            for i in range(self.num - 1, 0, -1):
                self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])

        def update(self, k, x):
            """
            k番目の値をxに更新
            k: index(0-index)
            x: update value
            """
            k += self.num
            self.tree[k] = x
            while k > 1:
                self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])
                k >>= 1

        def query(self, l, r):
            """
            [l, r)のsegfuncしたものを得る
            l: index(0-index)
            r: index(0-index)
            """
            res = self.ide_ele
            l += self.num
            r += self.num
            while l < r:
                if l & 1:
                    res = self.segfunc(res, self.tree[l])
                    l += 1
                if r & 1:
                    res = self.segfunc(res, self.tree[r - 1])
                l >>= 1
                r >>= 1
            return res

    
    
    
    
    
    
    
    

    def BellmanFord(N, M, ABC, vertex_start, vertex_end, value_if_inf = -1, find_shortest = False):
        """to calculate furthest or shortest length between vertex_start and vertex_end using BellmanFord algorithm
        
        Args:
            N (int): number of vertices
            M (int): number of edges
            ABC (list): [(ai, bi, ci) for _ in range(N)] where i-th edge is directed from vertex ai to vertex bi and the length is ci 
            vertex_start (int): start vertex. usually use 0.
            vertex_end (int): end vertex. usually use N-1.
            value_if_inf (int or string as you like, optional): value you want when the furthest (or shortest) distance is infinite (or -infinite). Defaults to -1.
            find_shortest (bool, optional): choose False to find furthest path. Defaults to False.
        
        Returns:
            int or string: normally int (but can be str if you set value_if_inf to str)
            
        Example:
                N, M, P = R()
                ABC = [R() for _ in range(M)]
                ABC = [(a-1, b-1, c-P) for a, b, c in ABC]
                print(BellmanFord(N, M, ABC, 0, N-1, value_if_inf = 'inf'))

        """

        def make_reachable_list(N, M, ABC, vertex_start, vertex_end):
            reachable_to_direct = defaultdict(list)
            reachable_from_direct = defaultdict(list)
            reachable_from_start = [False] * N
            reachable_to_end = [False] * N
            reachable_from_start[vertex_start] = True
            reachable_to_end[vertex_end] = True
            reachable_from_both_sides = [False] * N
            dfs_from_start = []
            dfs_to_end = []
            for a, b, c in ABC:
                reachable_to_direct[a].append(b)
                reachable_from_direct[b].append(a)
                if a == vertex_start:
                    dfs_from_start.append(b)
                    reachable_from_start[b] = True
                if b == vertex_end:
                    dfs_to_end.append(a)
                    reachable_to_end[a] = True
            while dfs_from_start:
                v = dfs_from_start.pop()
                for i in reachable_to_direct[v]:
                    if not reachable_from_start[i]:
                        reachable_from_start[i] = True
                        dfs_from_start.append(i)
            while dfs_to_end:
                v = dfs_to_end.pop()
                for i in reachable_from_direct[v]:
                    if not reachable_to_end[i]:
                        reachable_to_end[i] = True
                        dfs_to_end.append(i)
            for i in range(N):
                reachable_from_both_sides[i] = reachable_from_start[i] and reachable_to_end[i]
            return reachable_from_both_sides
        
        reachable_from_both_sides = make_reachable_list(N, M, ABC, vertex_start, vertex_end)
        
        if find_shortest:
            dist = [INF for i in range(N)]
        else:
            dist = [-INF for i in range(N)]
        
        dist[vertex_start] = 0
        for i in range(N):
            updated = False
            for a, b, c in ABC:
                if not reachable_from_both_sides[a]:
                    continue
                elif find_shortest:
                    update_condition = dist[a] + c < dist[b]
                else:
                    update_condition = dist[a] + c > dist[b]
                if dist[a] != INF and update_condition:
                    dist[b] = dist[a] + c
                    updated = True
                    if i == N-1:
                        return value_if_inf
            if not updated:
                break
        return dist[vertex_end]

    
    def warshall_floyd(number_vertex, XYD, shift_one_for_vertex=False):
        
        
        
        
        
        d = [[float("inf")]*number_vertex for i in range(number_vertex)]
        for x, y, dist in XYD:
            if shift_one_for_vertex:
                x = x - 1
                y = y - 1
            d[x][y] = dist
            d[y][x] = dist
        for i in range(number_vertex):
            d[i][i] = 0 
        for k in range(number_vertex):
            for i in range(number_vertex):
                for j in range(number_vertex):
                    d[i][j] = min(d[i][j],d[i][k] + d[k][j])
        return d


    """ initialize variables and set inputs
    
        
        
            
            
    
        
        
        
        
        
        
        
    
        
        
        
        
    
        
        
    """

    
    r = lambda: sys.stdin.readline().strip()
    r_int = lambda: int(r())
    r_float = lambda: float(r())
    R = lambda: list(map(int, r().split()))
    R_str = lambda: r().split()
    R_map = lambda: map(int, r().split())
    R_float = lambda: list(map(float, r().split()))
    R_tuple = lambda: tuple(map(int, r().split()))

    """ how to treat input
    
    
    
    
    
    
    
    """

    
    if sample_file:
        sys.stdin = open(sample_file)
        
    
    
    
    N = r_int()
    AB = [R() for _ in range(N)]
    
    ab_0 = sorted(AB, key=itemgetter(0))
    ab_1 = sorted(AB, key=itemgetter(1))
    
    if N%2 == 0: 
        left = N//2 - 1
        right = N//2
        l = ab_0[left][0] + ab_0[right][0]
        r = ab_1[left][1] + ab_1[right][1]
        print(r-l+1)
    else:
        c = N//2
        l = ab_0[c][0]
        r = ab_1[c][1]
        print(r-l+1)
    
    
    
    

    """memo: how to use defaultdict of list
    
    Dic = defaultdict(list)
    
    Dic[x].append(y)
    
    for k, v in Dic.items():
    """
    
    """memo: how to solve binary problems
    
    >>> a = 5
    >>> bin_str_a = format(a, '
    >>> print(bin_str_a)
    0b0101 
    """
    
    """memo: how to solve the problem
    creating simple test/answer
    greed
    simple dp
    graph
    """

if __name__ == '__main__':
    main()

Solution (Python):
n=int(input())
a=sorted([list(map(int,input().split())) for i in range(n)])
b=sorted(a,key=lambda x:x[1])
if n%2==1:
    print(b[n//2][1]-a[n//2][0]+1)
else:
    print((b[n//2-1][1]+b[n//2][1])-(a[n//2-1][0]+a[n//2][0])+1)

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7

DR = [1, -1, 0, 0]
DC = [0, 0, 1, -1]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
     
def main():
    N = I()
    ab = []
    odd = False
    if N % 2 == 1:
        odd = True
    for i in range(N):
        ab.append(LI())

    
    beg_ab = sorted(ab, key=lambda x:x[0])
    en_ab = sorted(ab, key=lambda x:x[1])[::-1]
    
    if odd:
        l = beg_ab[N//2][0]
        r = en_ab[N//2][1]
        cnt = r - l + 1
    else:
        l1 = beg_ab[(N-1)//2][0]
        l2 = beg_ab[(N-1)//2 + 1][0]

        r1 = en_ab[(N-1)//2][1]
        r2 = en_ab[(N-1)//2 + 1][1]
        cnt = 2 * ((r1+r2)/2 - (l1+l2)/2) + 1
    print(int(cnt))


main()

Solution (Python):
from sys import stdin, setrecursionlimit


def main():
    input = stdin.buffer.readline
    n = int(input())
    ab = [list(map(int, input().split())) for _ in range(n)]
    min_arr = sorted(ab, key=lambda x: x[0])
    max_arr = sorted(ab, key=lambda x: x[1])
    if n % 2 != 0:
        a = min_arr[n // 2][0]
        b = max_arr[n // 2][1]
        print(b - a + 1)
    else:
        a1 = min_arr[(n - 1) // 2][0]
        b1 = max_arr[(n - 1) // 2][1]
        a2 = min_arr[(n + 1) // 2][0]
        b2 = max_arr[(n + 1) // 2][1]
        print(b1 + b2 - a1 - a2 + 1)


if __name__ == "__main__":
    setrecursionlimit(10000)
    main()

Solution (Python):
from statistics import median

n = int(input())
x_min = []
x_max = []
for _ in range(n):
    a, b = map(int, input().split())
    x_min.append(min(a, b))
    x_max.append(max(a, b))

print(int((median(x_max)-median(x_min))*2)+1 if n % 2 == 0 else median(x_max)-median(x_min)+1)

Solution (Python):
import statistics
n = int(input())
arraya = []
arrayb = []
for i in range(n):
    a,b = map(int, input().split())
    arraya.append(a)
    arrayb.append(b)

min_median = statistics.median(arraya)
max_median = statistics.median(arrayb)
if n%2 == 0:
    print(int((max_median - min_median)//0.5 + 1))
else:
    print(int(max_median - min_median + 1))

Solution (Python):
n = int(input())

start = []
end = []
for i in range(n):
    a,b = map(int, input().split())
    start.append(a)
    end.append(b)
start.sort()
end.sort()
if (n%2==1):
    print(end[n//2]-start[n//2]+1)
else:
    s = start[n//2-1]+start[n//2]
    e = end[n//2-1]+end[n//2]
    print(e-s+1)

Solution (Python):
import sys
import math
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7

def main():
    N = int(readline())
    A = []
    B = []
    for _ in range(N):
        a, b = map(int, readline().split())
        A.append(a)
        B.append(b)
    A.sort()
    B.sort()
    if N%2==1:
        l = A[N//2]
        r = B[N//2]
        print(r-l+1)
    else:
        l1 = A[N//2-1]
        r1 = B[N//2-1]
        l2 = A[N//2]
        r2 = B[N//2]
        ans = (r2+r1) - (l2+l1) + 1
        print(ans)


if __name__ == '__main__':
    main()

Solution (Python):
def main():
    from math import ceil
    N = int(input())
    A, B = [0] * N, [0] * N
    l, r = 0, 0
    for i in range(N):
        A[i], B[i] = map(int, input().split())
    A.sort(), B.sort()
    
    c_min, c_max = 0, 0
    ans = 0

    if(N % 2):
        N -= 1
        c_min = A[(N + 1) // 2]
        c_max = B[(N + 1) // 2]
        ans = c_max - c_min + 1

    else:
        N -= 1
        c_min = (A[N // 2] + A[N // 2 + 1]) / 2
        c_max = (B[N // 2] + B[N // 2 + 1]) / 2
        ans = (c_max - c_min) * 2 + 1

    print(int(ans))


if __name__ == "__main__":
    main()

Solution (Python):
A = []
B = []
N = int(input())
for i in range(N):
    a, b = [int(i) for i in input().split()]
    A.append(a)
    B.append(b)

A.sort()
B.sort()

if N%2==1:
    mi = N//2
    lmed = A[mi]
    rmed = B[mi]
    print(rmed-lmed+1)

if N%2==0:
    mir = N//2
    mil = mir-1
    lmed = (A[mir]+A[mil]) / 2
    rmed = (B[mir]+B[mil]) / 2
    print(int(2*(rmed-lmed)+1))

Solution (Python):
import sys

sys.setrecursionlimit(10**6)
readline = sys.stdin.readline


def main():
    N = int(input())
    Alist = []; Blist = []
    for _ in range(N):
        A, B = map(int, readline().split())
        Alist.append(A); Blist.append(B)
    Alist.sort()
    Blist.sort()
    i = N//2
    if N%2 == 0:
        medmin = (Alist[i] + Alist[i-1])
        medmax = (Blist[i] + Blist[i-1])
        ans = medmax - medmin + 1
    else:
        ans = Blist[i] - Alist[i] + 1
    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 8)

input = sys.stdin.readline


def main():
    N = int(input())
    AB = [[int(x) for x in input().split()] for _ in range(N)]

    if N % 2 == 1:
        ma = []
        mi = []
        for a, b in AB:
            ma.append(max(a, b))
            mi.append(min(a, b))
        ma.sort()
        mi.sort()
        print(ma[N // 2] - mi[N // 2] + 1)
    else:
        ma = []
        mi = []
        for a, b in AB:
            ma.append(max(a, b))
            mi.append(min(a, b))

        ma.sort()
        mi.sort()
        x = (ma[N // 2] + ma[N // 2 - 1]) / 2
        y = (mi[N // 2] + mi[N // 2 - 1]) / 2
        print(int((x - y) / 0.5) + 1)


if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
list_a = []
list_b = []
for i in range(n):
    a,b = (int(x) for x in input().split())
    list_a.append(a)
    list_b.append(b)
list_a.sort()
list_b.sort()

if n%2==0:
    mi = (list_a[int(n/2)]+list_a[int(n/2)-1])/2
    ma = (list_b[int(n/2)]+list_b[int(n/2)-1])/2
    print(int((ma-mi)*2+1))
else:
    mi = list_a[int((n-1)/2)]
    ma = list_b[int((n-1)/2)]
    print(int(ma-mi+1))

Solution (Python):
import numpy as np
N =int(input())
A_B = []
for i in range(N):
    A_B.append(list(map(int,input().split())))
if N % 2 == 1:
    A_B = np.array(A_B).T.tolist()
    min_array = A_B[0]
    min_array.sort()
    min_ = min_array[N // 2]
    max_array = A_B[1]
    max_array.sort()
    max_ = max_array[N // 2]
    print(max_ - min_ + 1)
else:
    A_B = np.array(A_B).T.tolist()
    
    min_array = A_B[0]
    min_array.sort()
    min_ = [min_array[N // 2],min_array[N // 2 - 1]]
    max_array = A_B[1]
    max_array.sort()
    max_ = [max_array[N // 2],max_array[N // 2 - 1]]
    print(max_[0] + max_[1] - min_[0] - min_[1] + 1)

Solution (Python):
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,copy
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))

n = inp()
ab = [inpl() for _ in range(n)]
ab.sort()
if n%2:
    l = ab[n//2][0]
    ab.sort(key = lambda x:x[1])
    r = ab[n//2][1]
    print(r-l+1)
else:
    l1 = ab[n//2-1][0]
    l2 = ab[n//2][0]
    ab.sort(key = lambda x:x[1])
    r1 = ab[n//2-1][1]
    r2 = ab[n//2][1]
    print((r2+r1)-(l2+l1)+1)

Solution (Python):
import numpy as np
N = int(input())
table = np.array([list(map(int, input().split())) for _ in range(N)])

inf, sup = np.median(table, axis=0)
diff = sup - inf
if N % 2 == 0:
    diff *= 2
print(int(diff + 1))

Solution (Python):
import sys
def main():
    input = sys.stdin.readline
    N = int(input())
    AB = [tuple(map(int, input().split())) for _ in range(N)]
    mni = (N - 1) // 2
    mxi = mni if N & 1 else mni + 1
    AB.sort(key=lambda x: x[0])
    mmn = (AB[mni][0] + AB[mxi][0]) / 2
    AB.sort(key=lambda x: x[1])
    mmx = (AB[mni][1] + AB[mxi][1]) / 2
    t = 1 if N & 1 else 2
    print(int((mmx - mmn) * t) + 1)

if __name__ == '__main__':
    main()

Solution (Python):
n,*ab = map(int,open(0).read().split())
a = sorted(ab[::2])
b = sorted(ab[1::2])
m = (n-1)//2
if n % 2 == 0:
  print(b[m]-a[m]+b[m+1]-a[m+1]+1)
else:
  print(b[m]-a[m]+1)