← 返回题目
题库练习 [COCI-2007_2008-contest4]#4 POKLON
← 上一题 下一题 →

A1122 | [COCI-2007_2008-contest4]#4 POKLON

来源COCI
时间限制1s
内存限制128MB
通过 / 提交0/0

题目描述

Mirko got a set of intervals for his birthday. There are many games he can play with them. In one of them, Mirko must find the longest sequence of distinct intervals such that each interval in the sequence is in the set and that each interval contains the one that follows in the sequence.
Write a program which finds one such longest sequence.

输入格式

The first line of input contains the integer N (1 ≤ N ≤ 100000), the number of intervals in the set.
Each of the following N lines contains two integers A and B describing one interval (1 ≤ A < B ≤ 1000000).

输出格式

Output the length K of the longest sequence on the first line.
Each of the following K lines should contain one element of the sequence, an interval in the same format it was given in the input.

输入输出样例

输入 #1
3 
3 4 
2 5 
1 6
输出 #1
3 
1 6 
2 5 
3 4
输入 #2
5 
10 30 
20 40 
30 50 
10 60 
30 40
输出 #2
3 
10 60 
30 50 
30 40
输入 #3
6 
1 4 
1 5 
1 6 
1 7 
2 5 
3 5
输出 #3
5 
1 7 
1 6 
1 5 
2 5 
3 5
C++ 编辑器
输入
输出