Restaurant Customers cses problem solution with code and explanation

 Restaurant Customers cses problem solution -

Problem Statement-

• Time limit: 1.00 s
 
• Memory limit: 512 MB

You are given the arrival and leaving times of n$n$ customers in a restaurant.

What was the maximum number of customers?

Input

The first input line has an integer n$n$: the number of customers.

After this, there are n$n$ lines that describe the customers. Each line has two integers a$a$ and b$b$: the arrival and leaving times of a customer.

You may assume that all arrival and leaving times are distinct.

Output

Print one integer: the maximum number of customers.

Constraints

• 1≤n≤2⋅105$1\le n\le 2\cdot {10}^5$
  
• 1≤a<b≤109$1\le a<b\le {10}^9$
  

Example

Input:
3
5 8
2 4
3 9

Output:
2







solution-

Step 1- take input in a  vector which contain pair of int and bool and insert arrival time as true and leaving time as false.

Step 2- sort the vector.

stem 3- iterate over vector and when you found true update max if max > ans 

step 4- else if you strike false update ans as ans-1

Here is code solution -