A new semester is coming, there are many (girl) students moving out of the
dormitory and renting house outside the school. And that is a chance for Missile,
who is still single. He wants to get close to them. Here is his plan: he is going to
move to a place that the total distance to all of the (girl) student is minimized.
The distance is the absolute value of the difference between two street numbers.
The input consists of several test cases. The first line contains the number of
test cases.
For each test case, you will be given an integer number of students, r ( 0 < r < 500)
and the street numbers (also integers), si, where the students live ( 0 < si < 109 ).
Note that several students might have the same street number.
For each test case, your program must output the minimal sum of distances
from Missile's house to each of the students' house. The distance between two
street numbers si and sj is dij= |si-sj|.