当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

5124:lines

题目描述
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.
输入解释
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.
输出解释
For each case, output an integer means how many lines cover A.
输入样例
2
5
1 2 
2 2
2 4
3 4
5 1000
5
1 1
2 2
3 3
4 4
5 5
输出样例
3
1
来自杭电HDUOJ的附加信息
Recommend heyang

该题目是Virtual Judge题目,来自 杭电HDUOJ

题目来源 BestCoder Round #20

源链接: HDU-5124

最后修改于 2020-10-25T23:20:00+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
5000/2500MS(Java/Others) 32768/32768K(Java/Others)