1227A.md (2088B)
1 Source: https://codeforces.com/problemset/problem/1227/A 2 3 A. Math Problem 4 5 time limit per test 6 7 2 seconds 8 9 memory limit per test 10 11 256 megabytes 12 13 input 14 15 standard input 16 17 output 18 19 standard output 20 21 Your math teacher gave you the following problem: 22 23 There are $n$ segments on the $x$-axis, $[l_1; r_1], [l_2; r_2], \ldots, [l_n; r_n]$. The segment $[l; r]$ includes the bounds, i.e. it is a set of such $x$ that $l \le x \le r$. The length of the segment $[l; r]$ is equal to $r - l$. 24 25 Two segments $[a; b]$ and $[c; d]$ have a common point (intersect) if there exists $x$ that $a \leq x \leq b$ and $c \leq x \leq d$. For example, $[2; 5]$ and $[3; 10]$ have a common point, but $[5; 6]$ and $[1; 4]$ don't have. 26 27 You should add one segment, which has at least one common point with each of the given segments and as short as possible (i.e. has minimal length). The required segment can degenerate to be a point (i.e a segment with length zero). The added segment may or may not be among the given $n$ segments. 28 29 In other words, you need to find a segment $[a; b]$, such that $[a; b]$ and every $[l_i; r_i]$ have a common point for each $i$, and $b-a$ is minimal. 30 31 Input 32 33 The first line contains integer number $t$ ($1 \le t \le 100$) — the number of test cases in the input. Then $t$ test cases follow. 34 35 The first line of each test case contains one integer $n$ ($1 \le n \le 10^{5}$) — the number of segments. The following $n$ lines contain segment descriptions: the $i$-th of them contains two integers $l_i,r_i$ ($1 \le l_i \le r_i \le 10^{9}$). 36 37 The sum of all values $n$ over all the test cases in the input doesn't exceed $10^5$. 38 39 Output 40 41 For each test case, output one integer — the smallest possible length of the segment which has at least one common point with all given segments. 42 43 Example 44 45 Input 46 47 ``` 48 4 49 3 50 4 5 51 5 9 52 7 7 53 5 54 11 19 55 4 17 56 16 16 57 3 12 58 14 17 59 1 60 1 10 61 1 62 1 1 63 ``` 64 65 Output 66 67 ``` 68 2 69 4 70 0 71 0 72 ``` 73 74 Note 75 76 In the first test case of the example, we can choose the segment $[5;7]$ as the answer. It is the shortest segment that has at least one common point with all given segments.