发布时间: 2018年12月8日 20:11   最后更新: 2018年12月8日 20:12   时间限制: 1000ms   内存限制: 512M

Given a classroom and $n$ requests, each of which is to borrow the classroom during $[l_i,r_i]$.

How many requests at most can be met at the same time?

Input starts with an integer $n(1 \le n \le 10^5)$, representing the number of requests.

After this are $n$ lines specifying the requests. Each of these lines contains two integers $l_i,r_i(1 \le l_i \le r_i \le 10^9)$, representing the interval of each these requests, respectively.

Display an single integer representing at most the number of requests met at the same time.

1 5
1 5
1 3
4 5

$[1,3], [4,5]$ can be met at the same time.

2018 fdupc

2018 FDUPC 程序设计校赛现场赛(网络同步赛)