|
||||||||||
linesTime Limit: 5000/2500 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3226 Accepted Submission(s): 1301 Problem Description John has several lines. The lines are covered on the X axis. Let A is a point which is covered by the most lines. John wants to know how many lines cover A. Input The first line contains a single integer $T(1 \leq T \leq 100)$(the data for $N > 100$ less than 11 cases),indicating the number of test cases. Each test case begins with an integer $N(1 \leq N \leq 10^5)$,indicating the number of lines. Next N lines contains two integers $X_i$ and $Y_i(1 \leq X_i \leq Y_i \leq 10^9)$,describing a line. Output For each case, output an integer means how many lines cover A. Sample Input
Sample Output
Source | ||||||||||
|