#include<stdio.h>
#include<algorithm>
using namespace std;
int main()
{
int t,n,i,arr[101],minimal_distance;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&arr[i]);
}
sort(arr,arr+i);
minimal_distance=(arr[i-1]-arr[0])*2;
printf("%d\n",minimal_distance);
}
}
#include<algorithm>
using namespace std;
int main()
{
int t,n,i,arr[101],minimal_distance;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&arr[i]);
}
sort(arr,arr+i);
minimal_distance=(arr[i-1]-arr[0])*2;
printf("%d\n",minimal_distance);
}
}
0 comments: (+add yours?)
Post a Comment