- Time limit: 1.00 s
- Memory limit: 512 MB
What was the maximum number of customers in the restaurant at any time?
The first input line has an integer $n$: the number of customers.
After this, there are $n$ lines that describe the customers. Each line has two integers $a$ and $b$: the arrival and leaving times of a customer.
You may assume that all arrival and leaving times are distinct.
Print one integer: the maximum number of customers.
- $1 \le n \le 2 \cdot 10^5$
- $1 \le a < b \le 10^9$