DCP-38: Mysterious Pond Back to All Problems
Beginner
Beginners Problems > Ad-hoc
There is a mysterious pond in a forest of Savar. N numbers of friends of your brother Robi have gone to visit that pond, and you know all of them. To see the crystal clear water, they have decided to get down and they have got down in the pond, but getting down in the pond nobody can come back (they don’t know that before). After knowing this matter, your brother was so worried about his friends. You were so curious and said to your brother “I want to see this mysterious pond and know the real reason and also help them”. So after 50 minutes later, you have reached at the side of that pond and met the queen of the forest named Engky. She laughed and said to you- “I know where they are, I will give them back but you have to answer one of my question”. I will tell you each friend’s name(Fn) & time in minutes(Fm) of getting down all of them from now. Now you have to tell the name who got down at first & at last in the pond. Write a program to find answers. Note: They didn’t get down at the same time in the pond. Input: ------ Input start with an integer T(1≤T≤100) T means test case. Each test case contain an integer N(3≤N≤20). N means numbers of Robi’s friends. Next N line contains Fn (each friends name, length of the name will be 50 and contains small/capital characters) and after a space 5≤Fm≤10^6 (getting down time in minutes) in a single line of each N line. Output: ------- For each case, print: “X Y” (without quote), where X is the name of first person and Y is the name of last person, use new line after each case. Sample Input ------------ 1 5 Ayan 20 Punom 11 Eifty 9 Prioti 15 Surovi 12 Sample Output ------------- Ayan Eifty
