It is audit day at the coastal hub of Tidewater. Harper spreads the panels records across the table and picks up a sharp pencil. Task: n crews each guard a half-open interval [s,e). An interval ending at time t does not overlap one starting at t. Print the maximum number overlapping at any instant. Input format: First line: n. Next n lines: s e. Output format: Print the maximum simultaneous overlap. Constraints: 1 <= n <= 1600; 0 <= s < e <= 10^9.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 1600; 0 <= s < e <= 10^9.
