The purpose of this programming assignment is to practice using STL containers. This problem is selected from the online contest problem archivee, which is used mostly by college students world wide to challenge their programming ability and to prepare themselves for attending programming contests such as the prestige ACM International Collegiate Programming Contest . For your convenience,I copied the description of the problem below with my note on the I/O and a sample executable. Background The world-known gangster Vito Deadstone is moving to New York. He has a very big family there, all of them live on Lamafia Avenue. Since he will visit all his relatives very often, he is trying to find a house close to them. Problem Vito wants to minimize the total distance to all of them and has blackmailed you to write a program that solves his problem Input The input consists of several test cases. The first line contains the number of test cases. For each test case you will be given the integer number of relatives r (0r500) and the street numbers (also integers) where they live (0s30000). Note that several relatives could live in the same street number. Output For each test case your program must write the minimal sum of distances from the optimal Vito's house to each one of his relatives. The distance between two street numbers si and Sj is dj-Isi-sl