Solution of uva 10041 - Vito's Family

The world-known gangster Vito Deadstone is moving to New York. He has a very big family there, all
of them living in Lama a Avenue. Since he will visit all his relatives very often, he is trying to nd a
house close to them.
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 rst 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)
s
1
;s
2
;:::;s
i
;:::;s
r
where they live (0
<s
i
<
30000 ). 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
s
i
and
s
j
is
d
ij
=
j
s
i
...............................................................................................................................................
///Md. Alamgir Hossain
///Dept. of CSE,JUST
///alamgir.cse14.just@gmail.com
#include<bits/stdc++.h>
using namespace std;
int main()
{
    int t;
    cin>>t;
    while(t--){
        vector<int>v;
        int n;
        cin>>n;
        int arr[n];
        for(int i=0;i<n;i++){
            cin>>arr[i];
        }
        sort(arr,arr+n);
        long long int sum=0,res;
        for(int i=0;i<n;i++){
            for(int j=0;j<n;j++){
                sum=sum+abs(arr[i]-arr[j]);
            }
        v.push_back(sum);
        sum=0;
        }
        res=*min_element(v.begin(),v.end());

        cout<<res<<endl;
        v.clear();
    }
    return 0;
}
Previous
Next Post »