## Welcome To SDIBT ACM-ICPC Online Judge

Problem 1038. -- Vito## Vito

Time Limit: 1 Sec Memory Limit: 64 MB

Submit: 24 Solved: 9

[Submit][Status][Discuss]## Description

The famous gangster Vito Deadstone is moving to New York. He has a very big family there, all of them living on Lamafia Avenue. Since he will visit all his relatives very often, he wants to find a house close to them. Indeed, Vito wants to minimize the total distance to all of his relatives 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 (0 < r < 500) and the street numbers (also integers) s1, s2,..., si,..., sr where they live (0 < si < 30, 000). Note that several relatives might live at 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 dij = | si - sj|.

## Sample Input

2
2 2 4
3 2 4 6

## Sample Output

2
4

## HINT

## Source

UVA toolkit

[Submit][Status][Discuss]

HOME
Back

한국어 中文 English

All Copyright Reserved 2008-2010 SDIBT TEAM

GPL2.0 2003-2010 HUSTOJ Project TEAM

Anything about the Problems, Please Contact Admin:admin