PTA 1082 shooting competition (20 points)

subject

The rules of shooting competition given in this topic are very simple , Who shot the hole closest to the bull's eye , Who is the champion ; Who is the worst , Who is a rookie . This problem gives the plane coordinates of a series of bullet holes (x,y), Please write a program to find out the champion and rookie . Let's assume that the bull's-eye is at the origin (0,0).

Input format ：

Input gives a positive integer in the first line N（≤ 10 000）. And then N That's ok , Each line is given in the following format ：

ID x y

among ID It's the athlete's number （ from 4 Digit composition ）;x and y Is the plane coordinate of the bullet hole it hit (x,y), All are integers , And 0 ≤ |x|, |y| ≤ 100. The title ensures that the number of each athlete is not repeated , And everyone only plays 1 gun .

Output format ：

Output the number of champion and rookie , The middle space 1 grid . The title guarantees that they are the only .

 sample input ：
3
0001 5 7
1020 -1 3
0233 0 -1
 No blank lines at the end 
 sample output ：
0233 0001
 No blank lines at the end 

Their thinking

inputCount = int(input())
# inputCount = 3
menberNoList = []
menberLengthList = []
for i in range(inputCount):
    inputList = input().split(" ")
    # inputList = "0001 5 7".split(" ")
    menberNoList.append(inputList[0])
    x = abs(int(inputList[1]))
    y = abs(int(inputList[2]))
    #  You can use the square root , But that's one less layer 
    length = x*x + y*y
    menberLengthList.append(length)
# Get the longest and shortest distance index
maxIndex = menberLengthList.index(max(menberLengthList))
minIndex = menberLengthList.index(min(menberLengthList))
print(str(menberNoList[minIndex]) + " " + str(menberNoList[maxIndex]))