Merge Intervals

Given a list of intervals, merge every pair that overlaps or touches, and print the result sorted by start. Intervals [1, 4] and [4, 5] touch at 4, so they merge into [1, 5].

Input:

• Line 1: n, the number of intervals.
• Then n lines start end (start <= end), in any order.

Output: the merged intervals, one start end per line, sorted by start.

1 <= n <= 200, values between 0 and 10^6.