CodeForces - 30D King‘s Problem?【贪心】

题目链接：https://codeforces.com/contest/30/problem/D

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <climits>
#include <cstring>
#include <vector>
#include <string>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <map>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
using namespace std;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define lowbit(x) (x & (-x))
#define CASET int _; scanf("%d", &_); for(int kase=1;kase<=_;kase++)

typedef double db;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> PII;

static const int INF=0x3f3f3f3f;
static const ll INFL=0x3f3f3f3f3f3f3f3f;
static const db EPS=1e-10;
static const db PI=acos(-1.0);
static const int MOD=1e9+7;

template <typename T>
inline void read(T &f) {
    f = 0; T fu = 1; char c = getchar();
    while (c < '0' || c > '9') { if (c == '-') { fu = -1; } c = getchar(); }
    while (c >= '0' && c <= '9') { f = (f << 3) + (f << 1) + (c & 15); c = getchar(); }
    f *= fu;
}
template <typename T>
void print(T x) {
    if (x < 0) putchar('-'), x = -x;
    if (x < 10) putchar(x + 48);
    else print(x / 10), putchar(x % 10 + 48);
}
static const int MAXN=1e5+10;
int n,k;
int x[MAXN],xx,yy;
db distance(db x1,db y1,db x2,db y2) { return sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2)); }
int main()
{
	read(n);read(k);
	for(int i=1;i<=n;i++) read(x[i]);
	read(xx);read(yy);
	int st=x[k];
	sort(x+1,x+n+1);
	if(k==n+1) printf("%.8lf\n",min(distance(x[1],0,xx,yy)+x[n]-x[1],distance(x[n],0,xx,yy)+x[n]-x[1]));
	else
	{
		k=lower_bound(x+1,x+n+1,st)-x;
		db ans=min(distance(st,0,x[1],0)+distance(x[1],0,x[n],0)+distance(x[n],0,xx,yy),
				   distance(st,0,x[n],0)+distance(x[n],0,x[1],0)+distance(x[1],0,xx,yy));
		for(int i=k;i<n;i++)
			ans=min(ans,min(distance(st,0,x[1],0)+distance(x[1],0,x[i],0)+distance(x[i],0,xx,yy),
							distance(st,0,x[i],0)+distance(x[i],0,x[1],0)+distance(x[1],0,xx,yy))
					   +min(distance(xx,yy,x[n],0)+distance(x[n],0,x[i+1],0),
					        distance(xx,yy,x[i+1],0)+distance(x[i+1],0,x[n],0)));
		for(int i=2;i<=k;i++)
			ans=min(ans,min(distance(st,0,x[i],0)+distance(x[i],0,x[n],0)+distance(x[n],0,xx,yy),
						    distance(st,0,x[n],0)+distance(x[n],0,x[i],0)+distance(x[i],0,xx,yy))
					   +min(distance(xx,yy,x[1],0)+distance(x[1],0,x[i-1],0),
					        distance(xx,yy,x[i-1],0)+distance(x[i-1],0,x[1],0)));
		printf("%.8lf\n",ans);
	}
    return 0;
}