|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초||128 MB||38||18||17||60.714%|
There is given the series of n closed intervals [ai: bi], where i = 1, 2, ..., n. The sum of those intervals may be represented as a sum of closed pairwise non-intersecting intervals. The task is to find such representation with the minimal number of intervals. The intervals of this representation should be written in the output file in asceding order. We say that the intervals [a: b] and [c: d] are in ascending order if, and only if a ≤ b < c ≤ d.
Write a program which:
In the first line of the standard input there is one integer n, 3 ≤ n ≤ 50 000. This is the number of intervals. In the (i+1)-st line, 1 ≤ i ≤ n, there is a description of the interval [ai: bi] in the form of two integers ai and bi separated by a single space, which are respectively the beginning and the end of the interval, 1 ≤ ai ≤ bi ≤ 1 000 000.
The standard output should contain descriptions of all computed pairwise non-intersecting intervals. In each line should be written a description of one interval. It should be composed of two integers, separated by a single space, the beginning and the end of the interval respectively. The intervals should be written into the output file in ascending order.
5 5 6 1 4 10 10 6 9 8 10
1 4 5 10