UVA 10041 (13.08.25)

Problem C: Vito's family 
 
Background 
The world-known gangster Vito Deadstone is moving to New York. He hasa very big family there, all of them living in Lamafia Avenue. Sincehe will visit all his relatives very often, he is trying to find ahouse close to them.
 
Problem 
Vito wants to minimize the total distance toall 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 testcase you will be given the integer number of relatives r (0 < r < 500)and the street numbers (also integers) wherethey live (0 < si < 30000 ). Note that several relatives could live inthe same street number.
 
Output 
For each test case your program must write the minimal sum ofdistances from the optimal Vito's house to each one of hisrelatives. The distance between two street numbers s i and s j is d ij= | s i- s j|.
 
Sample Input 

2

2 2 4 

3 2 4 6

Sample Output 

2

4

제목:
주인공 에 게 정착 할 자 리 를 찾 아 모든 이웃 과 의 거 리 를 최소 화 합 니 다 ~
생각:
중위 수 를 찾 은 후에 모든 거 리 를 중위 수 를 빼 면 된다.
물 문제 ~
AC 코드:
 

#include<stdio.h>

#include<algorithm>



using namespace std;



int R[555];



int main() {

    int T;

    scanf("%d", &T);

    while(T--) {

        int r;

        scanf("%d", &r);

        for(int i = 0; i < r; i++)

            scanf("%d", &R[i]);

        sort(R, R+r);

        int mid = R[r/2];

        int sum = 0;

        for(int i = 0; i < r; i++) {

            if(R[i] > mid)

                sum += R[i] - mid;

            else 

                sum += mid - R[i];

        }

        printf("%d
", sum);

    }

    return 0;

}