A8475 | Growing Mushrooms

The first input line contains four integer numbers $n$ , $t_{1}$ , $t_{2}$ , $k$ $(1<=n,t_{1},t_{2}<=1000; 1<=k<=100)$ — the number of participants, the time before the break, the time after the break and the percentage, by which the mushroom growth drops during the break, correspondingly.

Each of the following $n$ lines contains two integers. The $i$ -th $(1<=i<=n)$ line contains space-separated integers $a_{i}$ , $b_{i}$ $(1<=a_{i},b_{i}<=1000)$ — the speeds which the participant number $i$ chose.

Print the final results' table: $n$ lines, each line should contain the number of the corresponding dwarf and the final maximum height of his mushroom with exactly two digits after the decimal point. The answer will be considered correct if it is absolutely accurate.

- First example: for each contestant it is optimal to use firstly speed 2 and afterwards speed 4, because $2·3·0.5+4·3>4·3·0.5+2·3$ .