#include<stdio.h>
int temp[101];
void MergeSort(int x[], int left, int right){
    int mid, i, j, k;

    if (left >= right)
        return;
    mid = (left + right) / 2;
    MergeSort(x, left, mid);
    MergeSort(x, mid + 1, right);

    for (i = left; i <= mid; i++)
        temp[i] = x[i];
    for (i = mid + 1, j = right; i <= right; i++, j--)
        temp[i] = x[j];
    i = left;
    j = right;
    for (k = left; k <= right; k++)
        if (temp[i] <= temp[j])
            x[k] = temp[i++];
        else
            x[k] = temp[j--];
}
int main(void){
  int n,m,i,b,sum=0;
  int a[101];
  scanf("%d%d",&n,&m);
  for(i=0;i<n;i++){
    scanf("%d",&a[i]);
    sum+=a[i];
  }
  b=sum/(4*m);
  MergeSort(a,0,n-1);
  if(a[n-m]>=b){
    printf("Yes\n");
  }else{
    printf("No\n");
  }
  return 0;
}
