UVA Problem 11364 ( Parking) Solution

Problem Solving, UVa

 

 

#include <bits/stdc++.h>

using namespace std;

int main()

{

    int a[150],i,j,tc,n,sum;

    cin>>tc;

    while(tc--)

    {

        sum=0;

        cin>>n;

        for(i=0;i<n;i++)

        cin>>a[i];

        sort(a,a+n);

        for(i=0;i<n-1;i++)

        sum+=abs(a[i]-a[i+1]);

        sum*=2;

        cout<<sum<<endl;

    }

    return 0;

}

 

0 Comments

You may find interest following article