CF159E.Zebra Tower

普及/提高-

通过率：0%

AC君温馨提醒

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

题目描述

The first line contains an integer $n$ ( $2<=n<=10^{5}$ ) — the number of cubes. Next $n$ lines contain the descriptions of the cubes, one description per line. A cube description consists of two space-separated integers $c_{i}$ and $s_{i}$ ( $1<=c_{i},s_{i}<=10^{9}$ ) — the $i$ -th cube's color and size, correspondingly. It is guaranteed that there are at least two cubes of different colors.

输入格式

Print the description of the Zebra Tower of the maximum height in the following form. In the first line print the tower's height, in the second line print the number of cubes that form the tower, and in the third line print the space-separated indices of cubes in the order in which they follow in the tower from the bottom to the top. Assume that the cubes are numbered from 1 to $n$ in the order in which they were given in the input.

If there are several existing Zebra Towers with maximum heights, it is allowed to print any of them.

Please do not use the %lld specificator to read or write 64-bit integers in С++. It is preferred to use the cin, cout streams or the %I64d specificator.

输出格式

无

输入输出样例

输入#1
```
4
1 2
1 3
2 4
3 3
```
输出#1
```
9
3
2 3 1 
```
输入#2
```
2
1 1
2 1
```
输出#2
```
2
2
2 1 
```

首页