难题做不来。。只好写水题。。
/*
Easy
*/
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<algorithm>
#include<iostream>
#include<queue>
#include<map>
#include<stack>
#include<set>
#include<math.h>
using namespace std;
typedef long long int64;
//typedef __int64 int64;
typedef pair<int64,int64> PII;
#define MP(a,b) make_pair((a),(b))
const int maxn = 1005;
const int inf = 0x7fffffff;
const double pi=acos(-1.0);
const double eps = 1e-8;
double a[ maxn ];
int main(){
int T;
scanf("%d",&T);
while( T-- ){
int n;
scanf("%d",&n);
double sum = 0;
for( int i=1;i<=n;i++ ){
scanf("%lf",&a[i]);
sum += a[i];
}
double avi = sum/n;
int cnt = 0;
for( int i=1;i<=n;i++ ){
if( a[i]>avi )
cnt++;
}
cnt *= 100;
printf("%.3lf%%\n",1.0*cnt/(1.0*n));
}
return 0;
}