uva-10041-水题

题意：有个人想找到个房子住，并且他经常去其他街道，输入n条街，给这个人选择一条街，使得他去其他街道的距离总和最小。

排序，双重for

#include <string>
#include<iostream>
#include<map>
#include<memory.h>
#include<vector>
#include<algorithm>
#include<queue>
#include<vector>
#include<stack>
#include<math.h>
#include<iomanip>
#include<bitset>
#include"math.h"
namespace cc
{
    using std::cout;
    using std::endl;
    using std::cin;
    using std::map;
    using std::vector;
    using std::string;
    using std::sort;
    using std::priority_queue;
    using std::greater;
    using std::vector;
    using std::swap;
    using std::stack;
    using std::bitset;

    constexpr int N = ;
    int a[N];

    void solve()
    {
        int n,r;
        cin >> n;
        while (n--)
        {
            cin >> r;
            for (int i = ;i < r;i++)
                cin >> a[i];
            sort(a,a+r);
            int curMin = 0x7fffffff;
            for (int i=;i<r;i++)
            {
                int curTotal = ;
                for (int j=;j<r;j++)
                {
                    if (i == j)
                        continue;
                    int t = abs(a[i]-a[j]);
                    curTotal += t;
                    if (curTotal >= curMin)
                        break;
                }
                if (curTotal < curMin)
                    curMin = curTotal;
            }
            cout << curMin << endl;
        }

    }

};

int main()
{

#ifndef ONLINE_JUDGE
    freopen("d://1.text", "r", stdin);
#endif // !ONLINE_JUDGE
    cc::solve();

    return ;
}