看了上面的代码,自己又敲了一遍
from __future__ import division
T=int(input())
for tt in range(T):
n,k=[int(s) for s in raw_input().split()]
v=[int(s) for s in raw_input().split()]
v.sort(reverse=True)
dp=[]
ps=[]
ps.append(v[0])
for i in range(1,n):
ps.append(ps[i-1]+v[i])
dp.append(ps[n-1]/n)
for i in range(k):
j=0
while(j<n and v[j]>=dp[i]):
j=j+1
dp.append((dp[i]*(n-j)+ps[j-1])/n)
ans=dp[-1]
print("Case #{}: {}".format(tt+1, ans))