HDU 4355 Party All the Time

又是快读写错了。。。。。

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <queue>
#include <vector>
using namespace std;

#define N 50010
#define INF 0x3f3f3f3f
#define eps 1e-4

int T,n,m,tot;
double Min,Max,Ans;
double x[N],w[N];

inline int read()
{
    int x=0;char ch=getchar();
    while(ch<'0'||ch>'9')
        ch=getchar();
    while(ch<='9'&&ch>='0')
        x=x*10+ch-'0',ch=getchar();
    return x;
}

double Cal(double k)
{
    double Sum=0;
    for(int i=1;i<=n;i++)
    {
        double S=fabs(x[i]-k);
        Sum+=S*S*S*w[i];
    }
    return Sum;
}

double T_Find()
{
    double l=Min,r=Max,ll,rr;
    while(r-l>eps)
    {
        ll=l+(r-l)/3;
        rr=r-(r-l)/3;
        double Ans1=Cal(ll),Ans2=Cal(rr);
        if(Ans1<Ans2)
            r=rr;
        else l=ll;
    }
    return l;
}

int main()
{
    T=read();
    while(T--)
    {
        n=read();
        Min=INF;Max=-INF;
        for(int i=1;i<=n;i++)
        {
            scanf("%lf%lf",&x[i],&w[i]);
            Min=min(Min,x[i]);
            Max=max(Max,x[i]);
        }
        double qwer=T_Find();
        printf("Case #%d: %lld\n",++tot,(long long)(Cal(qwer)+0.5));
    }
    return 0;
}