A7877. Event Dates
编程题
普及/提高-
知识点
题目描述
On a history lesson the teacher asked Vasya to name the dates when $n$ famous events took place. He doesn't remembers the exact dates but he remembers a segment of days $[l_{i},r_{i}]$ (inclusive) on which the event could have taken place. However Vasya also remembers that there was at most one event in one day. Help him choose such $n$ dates of famous events that will fulfill both conditions. It is guaranteed that it is possible.
输入格式
The first line contains one integer $n$ ( $1<=n<=100$ ) — the number of known events. Then follow $n$ lines containing two integers $l_{i}$ and $r_{i}$ each ( $1<=l_{i}<=r_{i}<=10^{7}$ ) — the earliest acceptable date and the latest acceptable date of the $i$ -th event.
输出格式
Print $n$ numbers — the dates on which the events took place. If there are several solutions, print any of them. It is guaranteed that a solution exists.
输入输出样例
输入 #1
3 1 2 2 3 3 4
输出 #1
1 2 3
输入 #2
2 1 3 1 3
输出 #2
1 2