Caravans arrive at the spice bazaar of Saffronia with crates of windows, and Marek the registry keeper must account for every last one. 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 <= 2375; 0 <= s < e <= 10^9.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 2375; 0 <= s < e <= 10^9.
