HDU oj Osu! 5003

这道题看上去蛮吓人的，其实一看就明白，一看就明白

代码如下：

#include<iostream>#include<cstdio>#include<cmath>#include<algorithm>using namespace std;int cmp(int a,int b) {return a>b;}int main() {int t,n,i,a[55];double ans;scanf("%d",&t);while(t--) {scanf("%d",&n);ans=0;for(i=1; i<=n; i++) scanf("%d",&a[i]);sort(a+1,a+n+1,cmp);for(i=1; i<=n; i++) {ans+=pow(0.95,i-1)*a[i];}printf("%.10lf\n",ans);}return 0;}