CF1462F.The Treasure of The Segments

Polycarp found $n$ segments on the street. A segment with the index $i$ is described by two integers $l_i$ and $r_i$ — coordinates of the beginning and end of the segment, respectively. Polycarp realized that he didn't need all the segments, so he wanted to delete some of them.

Polycarp believes that a set of $k$ segments is good if there is a segment $[l_i, r_i]$ ($1 \leq i \leq k$) from the set, such that it intersects every segment from the set (the intersection must be a point or segment). For example, a set of $3$ segments $[[1, 4], [2, 3], [3, 6]]$ is good, since the segment $[2, 3]$ intersects each segment from the set. Set of $4$ segments $[[1, 2], [2, 3], [3, 5], [4, 5]]$ is not good.

Polycarp wonders, what is the minimum number of segments he has to delete so that the remaining segments form a good set?

波利卡普在街上找到了 $n$ 条线段。第 $i$ 条线段由两个整数 $l_i$ 和 $r_i$ 描述，分别表示该线段的起点和终点坐标。波利卡普意识到他并不需要所有这些线段，因此希望删除其中一部分。

波利卡普认为，一个包含 $k$ 条线段的集合是好的，当且仅当该集合中存在某一条线段 $[l_i, r_i]$（其中 $1 \leq i \leq k$），使得它与集合中的每一条线段都相交（交集必须是一个点或一条线段）。例如，由三条线段 $[[1, 4], [2, 3], [3, 6]]$ 构成的集合是好的，因为线段 $[2, 3]$ 与集合中每条线段均相交；而由四条线段 $[[1, 2], [2, 3], [3, 5], [4, 5]]$ 构成的集合则不是好的。

波利卡普想知道：他至少需要删除多少条线段，才能使剩余的线段构成一个好集合？

The first line contains a single integer $t$ ($1 \leq t \leq 2 \cdot 10^5$) — number of test cases. Then $t$ test cases follow.

The first line of each test case contains a single integer $n$ ($1 \leq n \leq 2 \cdot 10^5$) — the number of segments. This is followed by $n$ lines describing the segments.

Each segment is described by two integers $l$ and $r$ ($1 \leq l \leq r \leq 10^9$) — coordinates of the beginning and end of the segment, respectively.

It is guaranteed that the sum of $n$ for all test cases does not exceed $2 \cdot 10^5$.

第一行包含一个整数 $t$（$1 \leq t \leq 2 \cdot 10^5$），表示测试用例的数量。随后是 $t$ 个测试用例。

每个测试用例的第一行包含一个整数 $n$（$1 \leq n \leq 2 \cdot 10^5$），表示线段的数量。接下来是 $n$ 行，每行描述一条线段。

每条线段由两个整数 $l$ 和 $r$（$1 \leq l \leq r \leq 10^9$）描述，分别表示该线段的起点和终点坐标。

保证所有测试用例的 $n$ 值之和不超过 $2 \cdot 10^5$。

For each test case, output a single integer — the minimum number of segments that need to be deleted in order for the set of remaining segments to become good.

对于每个测试用例，输出一个整数——使得剩余线段集合变为“好”的所需删除的最少线段数量。