[解题报告]10041 - Vito's Family

最新推荐文章于 2026-04-20 02:32:35 发布

转载最新推荐文章于 2026-04-20 02:32:35 发布 · 167 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

原文链接：http://www.cnblogs.com/TheLaughingMan/archive/2013/02/24/2926980.html

本博客介绍了一个著名黑帮成员Vito Deadstone如何通过编程解决寻找最靠近其众多亲戚家的房子的问题，包括输入解析、排序算法（冒泡排序）、中位数查找以及计算最小总距离的方法。

Problem C: Vito's family

Background

The world-known gangster Vito Deadstone is moving to New York. He has a very big family there, all of them living in 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 ( 0 < r < 500) and the street numbers (also integers) $s_1, s_2, \ldots, s_i, \ldots, 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= |s_i-s_j|.

Sample Input

2
2 2 4 
3 2 4 6

Sample Output

2
4

Miguel Revilla
2000-11-19

冒泡排序，求中位数，再求解

#include<stdio.h>
int main()
{
    int k,n,i,j;
    int temp,s,sum,b;
    int a[30000];
    scanf("%d",&k);
    while(k--)
    {   sum=0;
        scanf("%d",&n);
        for(i=0;i<n;i++)
        scanf("%d",&a[i]);
        for(i=0;i<n-1;i++)
            for(j=0;j<n-i-1;j++)
            if(a[j]<a[j+1])
            {
                temp=a[j+1];
                a[j+1]=a[j];
                a[j]=temp;
            }

        if(n%2==0)
        s=(a[n/2-1]+a[n/2])/2;
        else
        s=a[n/2];
        for(i=0;i<n;i++)
        {
         b=s-a[i];
         if(b<0)
         b=b*-1;
         sum+=b;
        }
        printf("%d\n",sum);
    }
    return 0;
}