PROGRAMMING:Grab a red envelope
No one hasn't robbed red envelopes... Here are the records of red envelopes sent and robbed by $$n $$individuals. Please count their gains.
###Input format:
Enter the first line to give a positive integer $$n $$($$Le 10 ^ 4 $$), that is, the total number of people who participate in sending and grabbing red packets, then these people are numbered from 1 to $$n $. Next, line $$n $$and line $$I $$give the record of the red envelope issued by the person numbered $$I $, in the following format:
$$K\quad N_ 1\quad P_ 1\quad \cdots\quad N_ K\quad P_ K$$
Where $$k $$($$0 / Le K / Le 20 $$) is the number of red packets sent, $$n_ I $$is the number of the person who got the red envelope, $$p_ I $$($$> 0 $$) is the amount of red packets (in minutes). Note: for the red envelope sent by the same person, each person can only grab it once at most, not repeatedly.
###Output format:
According to the descending order of income amount from high to low, output the number and income amount of each person (in yuan, output 2 decimal places). Each person's information occupies a line, and there is a space between the two numbers. If the amount of income is parallel, the output will be decreased according to the number of red packets; If there are parallel, the output will be incremented by personal number.
###Input example:
```in
ten
3 2 22 10 58 8 125
5 1 345 3 211 5 233 7 13 8 101
1 7 8800
2 1 1000 2 1000
2 4 250 10 320
6 5 11 9 22 8 33 7 44 10 55 4 2
1 3 8800
2 1 23 2 123
1 8 250
4 2 121 4 516 7 112 9 10
```
###Output example:
```out
1 11.63
2 3.63
8 3.63
3 2.11
7 1.69
6 -1.67
9 -2.18
10 -3.26
5 -3.26
4 -12.32
```
answer：If there is no answer, please comment
###Input format:
Enter the first line to give a positive integer $$n $$($$Le 10 ^ 4 $$), that is, the total number of people who participate in sending and grabbing red packets, then these people are numbered from 1 to $$n $. Next, line $$n $$and line $$I $$give the record of the red envelope issued by the person numbered $$I $, in the following format:
$$K\quad N_ 1\quad P_ 1\quad \cdots\quad N_ K\quad P_ K$$
Where $$k $$($$0 / Le K / Le 20 $$) is the number of red packets sent, $$n_ I $$is the number of the person who got the red envelope, $$p_ I $$($$> 0 $$) is the amount of red packets (in minutes). Note: for the red envelope sent by the same person, each person can only grab it once at most, not repeatedly.
###Output format:
According to the descending order of income amount from high to low, output the number and income amount of each person (in yuan, output 2 decimal places). Each person's information occupies a line, and there is a space between the two numbers. If the amount of income is parallel, the output will be decreased according to the number of red packets; If there are parallel, the output will be incremented by personal number.
###Input example:
```in
ten
3 2 22 10 58 8 125
5 1 345 3 211 5 233 7 13 8 101
1 7 8800
2 1 1000 2 1000
2 4 250 10 320
6 5 11 9 22 8 33 7 44 10 55 4 2
1 3 8800
2 1 23 2 123
1 8 250
4 2 121 4 516 7 112 9 10
```
###Output example:
```out
1 11.63
2 3.63
8 3.63
3 2.11
7 1.69
6 -1.67
9 -2.18
10 -3.26
5 -3.26
4 -12.32
```
answer：If there is no answer, please comment