A Star not a Tree?

http://poj.org/problem?id=2420

找到一个点使得其到n个点的距离最近

#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<sstream>
#include<cstdio>
#include<ctime>
#include<map>
#include<stack>
#include<string>
#include<ctime>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-14
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define FASTIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
ll gcd(ll a,ll b){while(b^=a^=b^=a%=b);return a;}
const int maxn=2e5+9;
const int mod=1e8+7;

inline ll read()
{
    ll f=1,x=0;
    char ss=getchar();
    while(ss<'0'||ss>'9'){if(ss=='-')f=-1;ss=getchar();}
    while(ss>='0'&&ss<='9'){x=x*10+ss-'0';ss=getchar();}
    return f*x;
}

struct node
{
    double x,y;
}p[maxn];

int n;
double ansx=0;
double ansy=0;
double delta=0.996;
double res=1e18;

double dis(double x,double y)
{
    double sum=0;
    for(int i=0;i<n;i++)
    {
        sum=sum+sqrt((p[i].x-x)*(p[i].x-x)+(p[i].y-y)*(p[i].y-y));
    }
    return sum;
}
void SA()
{
    //初始值
    double t=3000;
    double tx=0,ty=0,tres=0;
    while(t>eps)
    {
        tx=ansx+(rand()*2-RAND_MAX)*t;//正负范围
        ty=ansy+(rand()*2-RAND_MAX)*t;
        tres=dis(tx,ty);
        if(tres<res)
        {
            ansx=tx;
            ansy=ty;
            res=tres;
        }
        else if(exp((res-tres)/t)*RAND_MAX>rand())//几率更新
        {
            ansx=tx;
            ansy=ty;
        }
        t=t*delta;//降温
    }
}
int main()
{
    //FASTIO;
    //#define endl '\n'

    while(~scanf("%d",&n))
    {
        srand(time(0));
        srand(rand());
        srand(rand());
        for(int i=0;i<n;i++)
        {
            p[i].x=read();
            p[i].y=read();
        }
        for(int i=0;i<10;i++) SA();
        printf("%.0lf\n",res);
    }
}