翻译题·15

718:Integer Intervals

【整数区间】

总时间限制:

1000ms

内存限制:

65536kB

描述

An integer interval [a,b], a < b, is a set of all consecutive integers beginning with a and ending with b.
Write a program that: finds the minimal number of elements in a set containing at least two different integers from each interval.

【一个整数区间[a,b],a<b,为一列连续整数以a开始，b结束。写一个程序：在一组至少包含两个不同整数区间中找到最小元素。】

输入

The first line of the input contains the number of intervals n, 1 <= n <= 10000. Each of the following n lines contains two integers a, b separated by a single space, 0 <= a < b <= 10000. They are the beginning and the end of an interval.

【输入第一行包含整数n，1 <= n <= 10000。接下来n行包含两个整数a，b，用一个空格隔开，0 <= a < b <= 10000.它们是整数区间的起始和结束。】

输出

Output the minimal number of elements in a set containing at least two different integers from each interval.

【输出包含来自每个间隔的至少两个不同整数的集合中的最小元素数。】

样例输入

4
3 6
2 4
0 2
4 7

样例输出

4

来源

CEOI 1997