Today is Ted's 100th birthday. A few weeks ago, you were selected by the
family to contact all of Ted's descendants and organize a surprise party.
To make this task easier, you created an age-prioritized list of everyone
descended from Ted. Descendants of the same age are listed in dictionary
order.
The only materials you had to aid you were birth certificates. Oddly
enough, these birth certificates were not dated. They simply listed the
father's name, the child's name, and the father's exact age when the baby
was born.
Input to this problem will begin with line containing a single integer
n indicating the number of data sets. Each data set will be
formatted according to the following description.
A single data set has 2 components:
Note:
For each data set, there will be X+1 lines of output. The first will
read, "DATASET Y", where Y is 1 for the first data set,
2 for the second, etc. The subsequent X lines constitute your
age-prioritized list of Ted's descendants along with their ages using the
format "NAME AGE". Descendants of the same age will be listed
in dictionary order.
2 1 Ted Bill 25 4 Ray James 40 James Beelzebub 17 Ray Mark 75 Ted Ray 20
DATASET 1 Bill 75 DATASET 2 Ray 80 James 40 Beelzebub 23 Mark 5
Migrated from old NTUJ.
| No. | Testdata Range | Score |
|---|