Scapegoat Gym - 101775B

 https://cn.vjudge.net/problem/Gym-101775B

 

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <stack>
//#include <tr1/unordered_map>
//#include <unordered_map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%lld",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 1e18
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

template<typename T>inline void read(T &x)
{
    x=0;
    static int p;p=1;
    static char c;c=getchar();
    while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
    while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
    x*=p;
}

//-----------------------------------------------
const int maxn=2e5+2;
const int mod=1e9+7;

double avg;
struct node
{
    int num;
    double val,cur,dis,gap;
    node(){}
    node(double _val,int _num,double _cur)
    {
        val=_val,num=_num;
        cur=_cur;
        dis=(cur-avg)*(cur-avg)*num;//总量
        gap=dis-((val/(num+1))-avg)*((val/(num+1))-avg)*(num+1);
    }

    bool operator < (const node &x) const
    {
       return gap<x.gap;
    }

}a[maxn];

int main()
{
    //FAST_IO;

    //freopen("input.txt","r",stdin);


    int T;

    int cas=0;

    //cin>>T;
    sfi(T);
    while(T--)
    {
        int n,m;
        //cin>>n>>m;
        sfi(n);
        sfi(m);
        avg=0;
        priority_queue<node>q;
        for(int i=1;i<=n;i++)
        {
            //cin>>a[i].val;
            sff(a[i].val);
            avg+=a[i].val;
            a[i].cur=a[i].val;
            a[i].num=1;
        }

        avg/=(double)m;

        for(int i=1;i<=n;i++) q.push(node(a[i].val,a[i].num,a[i].val));

        double ans=0;
        for(int i=n+1;i<=m;i++)
        {
            node tmp=q.top();
            q.pop();
            //cout<<tmp.val<<endl;
            tmp.num++;
            tmp.cur=(tmp.val)/(tmp.num);
            q.push(node(tmp.val,tmp.num,tmp.cur));
        }


        while(!q.empty())
        {
            node tmp=q.top();
            q.pop();
            ans+=tmp.dis;
        }

        ans/=(double)m;

        printf("Case #%d: %.12lf\n",++cas,ans);

    }



    return 0;
}