題目鏈接：

Osu!

time Limit: 2000/1000 MS (Java/Others)???

?Memory Limit: 65536/65536 K (Java/Others)

Problem Description Osu! is a famous music game that attracts a lot of people. In osu!, there is a performance scoring system, which evaluates your performance. Each song you have played will have a score. And the system will sort all you scores in descending order. After that, the i-th song scored a_i?will add 0.95^(i-1)*a_i?to your total score.

Now you are given the task to write a calculator for this system.

?

Input The first line contains an integer T, denoting the number of the test cases.

For each test case, the first line contains an integer n, denoting the number of songs you have played. The second line contains n integers a₁, a₂, ..., a_n?separated by a single space, denoting the score of each song.

T<=20, n<=50, 1<=a_i<=500.

?

Output For each test case, output one line for the answer.

Your answers will be considered correct if its absolute error is smaller than 1e-5.

?

Sample Input 1 2 530 478

?

Sample Output 984.1000000000 題意： 水題不說了; 思路： AC代碼： #include <bits/stdc++.h> using namespace std; const int N=1e6+5; typedef long long ll; const ll mod=1e9+7; int t,n; int a[1000]; int cmp(int x,int y) {return x>y; } int main() {scanf("%d",&t);while(t--){scanf("%d",&n);for(int i=1;i<=n;i++){scanf("%d",&a[i]);}double ans=0;sort(a+1,a+n+1,cmp);for(int i=1;i<=n;i++){ans+=pow(0.95,i-1)*(double)a[i];}printf("%.10lf\n",ans);}return 0; }

?

轉(zhuǎn)載于:https://www.cnblogs.com/zhangchengc919/p/5408226.html

總結(jié)

以上是生活随笔為你收集整理的hdu-5003 Osu!(水题)的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。