#include <stdio.h>

int partition(int a[],int p, int r){
  int x, i, j, t;
  x = a[r];
  i = p - 1;
  for(j=p; j<r; j++){
    if(a[j] <= x){
      i++;
      t = a[i];
      a[i] = a[j];
      a[j] = t;
    }
  }
  t = a[i+1];
  a[i+1] = a[r];
  a[r] = t;
  return i+1;
}

void quickSort(int a[],int p, int r){
  int q;
  if(p < r){
    q = partition(a, p, r);
    quickSort(a, p, q-1);
    quickSort(a, q+1, r);
  }
}

int main(){
  int n, m;
  scanf("%d%d", &n, &m);
  int i;
  int sum = 0;
  int a[n];
  for(i=0; i<n; i++){
    scanf("%d", &a[i]);
    sum += a[i];
  }
  quickSort(a, 0, n-1);
  
  if (a[n -1 - m] < (sum / (4 * m)))
    printf("No\n");
  else
    printf("Yes\n");
}