#include <bits/stdc++.h>
#include <iomanip>
using namespace std;
int main() {
int T,n,a[100001];
int sum=0;
double count;
cin >> T;
for(int i=0;i<T;i++){
cin >> n;
int k=0;
for(int j=0;j<n;j++){
cin >> a[j];
k+=a[j];//求和
}
sum=*max_element(a,a+n)-*min_element(a,a+n);
double v=(double)k/n;//精度问题要都转成double
double summary=0;
for(int m=0;m<n;m++){
summary+=(a[m]-v)*(a[m]-v);//求平方和
}
count =summary/(double)n;//这地方也是
cout << sum << " " << fixed << setprecision(3) << count;
cout << endl;
}
return 0;
}

京公网安备 11010502036488号