#include<bits/stdc++.h> using namespace std; #define int long long int n,k,a[200005],ans1=LLONG_MAX,ans2=LLONG_MAX,t[200005]; struct node{ int st,ed; }pos[200005]; void slv1(int i){ int p=i+(n-k)-1; while(p>=i){ int l=i,r=p; int pp=a[r]/2; while(l<r){ int mid=(l+r)>>1; if(a[mid]>pp)r=mid; else l=mid+1; } t[i]++; if(pos[i].st==0)pos[i].st=pp; pos[i].ed=pp; p=l-1; } ans1=min(ans1,t[i]); } signed main(){ ios::sync_with_stdio(0); cin.tie(0),cout.tie(0); cin>>n>>k; for(int i=1;i<=n;i++)cin>>a[i]; sort(a+1,a+n+1); for(int i=1;i+(n-k)-1<=n;i++)slv1(i); cout<<ans1<<" "; if(ans1==0){ cout<<k<<"\n"; return 0; } for(int i=1;i+(n-k)-1<=n;i++){ if(t[i]==ans1){ int L=i,R=i+(n-k)-1; int tmp=-1,l=1,r=i-1,bj=pos[i].ed; while(l<=r){ int mid=(l+r)>>1; if(a[mid]<=bj)l=mid+1; else{ tmp=mid; r=mid-1; } } if(tmp!=-1)L=tmp; tmp=-1,l=i+(n-k),r=n,bj=pos[i].st; while(l<=r){ int mid=(l+r)>>1; if(a[mid]/2==bj){ l=mid+1; tmp=mid; } else r=mid-1; } if(tmp!=-1)R=tmp; ans2=min(ans2,n-(R-L+1)); } } cout<<ans2<<"\n"; return 0; }