#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>

typedef int keytype;

//quicksort(<#keytype *a#>, <#int first#>, <#int last#>);
//long long ;
void quicksort(keytype a[], int first, int last){
    int i, j;
    keytype x, t;
    
    x = a[(first + last) / 2];
    i = first;  j = last;
    for ( ; ; ) {
        while (a[i] < x) i++;
        while (x < a[j]) j--;
        if (i >= j) break;
        t = a[i];  a[i] = a[j];  a[j] = t;
        i++;  j--;
    }
    if (first  < i - 1) quicksort(a, first , i - 1);
    if (j + 1 < last) quicksort(a, j + 1, last);
}

int gcd(int x, int y){
    if (y == 0) return x;
    else        return gcd(y, x % y);
}

int main() {
    int m,n,k,ans,a[1000],i,sum=0;
    scanf("%d %d",&n,&m);
    for (i=0; i<n; i++) {
        scanf("%d",&a[i]);
        sum+=a[n];
    }
    quicksort(a, 0, n-1);
    double hikaku = (double)sum/(4*(double)m);
    double hikaku_2 =(double)a[n-m];
    if( hikaku_2 <= hikaku ){
        printf("Yes");
    }else{
        printf("No");
    }
    return 0;
}
