CF45D.Event Dates

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

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 
```

首页