UVa OJ - 10041 Vito's family

The following program is my ACcepted code for UVA-10041 .
It's a for everybody to learn and discuss.
If there is any mistake or comment, please let me know.  :D

此乃UVA 10041 的AC code!

歡迎一同討論學習，如有錯誤與任何建議請留言 : )

點這裡看題目 Click here to see this Problem!

//This program is for UVA 10041 Vito's family
//題目來源 Problem link: http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=12&page=show_problem&problem=982

#include<stdio.h>
#include<stdlib.h>
using namespace std;

int main()
{
    int t, n, s[501];
    int max, min;
 
    scanf("%d", &t);
 
    while(t--)
    {
        scanf("%d", &n);
     
        max = 0;
        min = 30000;
     
        for(int i = 0; i< n; i++)
            scanf("%d", &s[i]);

     
        int ans = 15000001;
     
        for(int i = 0; i < n; i++)
        {
            int distance = 0;
            for(int j = 0; j < n; j++)
                distance = distance + abs(s[i] - s[j]);
            ans = ans > distance? distance: ans;
        }
        printf("%d\n", ans);
    }
 
    return 0;
}

Please feel free to use it after adding this blog as an reference. (http://autekroy.blogspot.tw) If there is any mistake or comment, please let me know. :D 

歡迎使用與分享任何內容，但請記得標示此部落格為出處。(http://autekroy.blogspot.tw/) 如果有發現任何的錯誤與建議請留言或跟我連絡。 : )