#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<algorithm>
#include<queue>
#include<vector>
#include<map>
#define ll long long
#define ull unsigned long long
#define max(a,b) (a>b?a:b)
#define min(a,b) (a<b?a:b)
#define lowbit(x) (x& -x)
#define mod 1000000007
#define inf 0x3f3f3f3f
#define eps 1e-18
#define maxn 1000010
inline ll read(){ll tmp=0; char c=getchar(),f=1; for(;c<'0'||'9'<c;c=getchar())if(c=='-')f=-1; for(;'0'<=c&&c<='9';c=getchar())tmp=(tmp<<3)+(tmp<<1)+c-'0'; return tmp*f;}
inline ll power(ll a,ll b){ll ans=1; for(;b;b>>=1){if(b&1)ans=ans*a%mod; a=a*a%mod;} return ans;}
inline ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
inline void swap(int &a,int &b){int tmp=a; a=b; b=tmp;}
using namespace std;
int a[maxn];
int n,k;
int main()
{n=read(); k=read();for(int i=1;i<=n;i++)a[i]=read();sort(a+1,a+n+1);
//    for(int i=1;i<=n;i++)printf("%d %d\n",i,a[i]);int ans=inf;for(int i=k;i<=n;i++)ans=min(ans,min(abs(a[i]),abs(a[i-k+1]))+a[i]-a[i-k+1]);printf("%d\n",ans);return 0;
}

#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<algorithm>
#include<queue>
#include<vector>
#include<map>
#define ll long long
#define ull unsigned long long
#define max(a,b) (a>b?a:b)
#define min(a,b) (a<b?a:b)
#define lowbit(x) (x& -x)
#define mod 1000000007
#define inf 0x3f3f3f3f
#define eps 1e-18
#define maxn 100010
inline ll read(){ll tmp=0; char c=getchar(),f=1; for(;c<'0'||'9'<c;c=getchar())if(c=='-')f=-1; for(;'0'<=c&&c<='9';c=getchar())tmp=(tmp<<3)+(tmp<<1)+c-'0'; return tmp*f;}
inline ll power(ll a,ll b){ll ans=1; for(;b;b>>=1){if(b&1)ans=ans*a%mod; a=a*a%mod;} return ans;}
inline ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
inline void swap(int &a,int &b){int tmp=a; a=b; b=tmp;}
using namespace std;
int bit[2*maxn];
int a[maxn];
int n;
void add(int x,int k){for(;x<=2*n;x+=lowbit(x))bit[x]+=k;}
int getsum(int x){int sum=0; for(;x;x-=lowbit(x))sum+=bit[x]; return sum;}
int check(int mid)
{for(int i=1;i<=2*n;i++)bit[i]=0;ll tot=0,sum=0;add(n,1);for(int i=1;i<=n;i++){sum+=(a[i]>=mid?1:-1);tot+=getsum(sum+n);add(sum+n,1);}
//    printf("%d %lld\n",mid,tot);return tot>=1ll*n*(n+1)/4;
}
int main()
{n=read();int mx=-inf,mn=inf;for(int i=1;i<=n;i++){a[i]=read();mx=max(mx,a[i]); mn=min(mn,a[i]);}int l=mn,r=mx;while(l<r){int mid=(l+r+1)>>1;if(check(mid))l=mid;else r=mid-1;}printf("%d\n",l);
}