1433. Optimal Parking(选择需要走追短路程的停车点)

#include <iostream>
#include <stdlib.h>
#include <algorithm>

using namespace std;
int position[20];

int main()
{
    int testNum;
    cin >> testNum;
    for(int i=1; i <= testNum; i++){
        int n;
        cin >> n;
        for(int k=0; k<n; k++)
           cin >> position[k];
        sort(position, position+n);
        cout << (position[n-1] - position[0])*2 << endl;     
    }
    system("pause");
    return 0;
}