$RT$，为啥这样全WA

#include<cstdio>
#include<algorithm>
#include<cstring>
#define N 100005

using namespace std;

int T,n,q,ans;
int a[N];
double avg,sum[N];

inline bool cmp(const int &x,const int &y){
	return x>y;
}

int main(){
	scanf("%d",&T);
	while(T--){
		scanf("%d%d",&n,&q);
		for(int i=1;i<=n;i++)
			scanf("%d",&a[i]);
		sort(a+1,a+1+n,cmp);
		for(int i=1;i<=n;i++)
			sum[i]=sum[i-1]+a[i];
		for(int i=1;i<=q;i++){
			double k;
			scanf("%lf",&k);	
			int l=1,r=n,mid;
			while(l<=r){
				mid=(l+r)>>1;
				avg=sum[mid]/mid-k;
				if(a[mid]>=avg){
					ans=mid;
					l=mid+1;
				}
				else r=mid-1;
			}
			printf("%d ",ans);
		}
		printf("\n");
	}
	return 0;
}