import java.util.*;

class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int M = sc.nextInt();
      
      	if(N == 1) {
          System.out.println("Yes");
        }
        
        else {
      	Integer a[] = new Integer[N];
      	for (int i=0; i<N; i++) {
            a[i] = sc.nextInt();
        }
        Arrays.sort(a, Comparator.reverseOrder());
      
      	double sum = 0;
        for (int i=0; i<N; i++) {
          sum += a[i];
        }
      
      	double sum2 = sum * 1 / (4 * M);
          
        int i2 = 0;
      	while(a[i2] >= sum2) {
          i2++;
          if(i2 >= N) break;
        }
      	
      	if (i2 >= M)
            System.out.println("Yes");
        else
            System.out.println("No");
        }
    }
} import java.util.*; util.* java class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int M = sc.nextInt();
      
      	if(N == 1) {
          System.out.println("Yes");
        }
        
        else {
      	Integer a[] = new Integer[N];
      	for (int i=0; i<N; i++) {
            a[i] = sc.nextInt();
        }
        Arrays.sort(a, Comparator.reverseOrder());
      
      	double sum = 0;
        for (int i=0; i<N; i++) {
          sum += a[i];
        }
      
      	double sum2 = sum * 1 / (4 * M);
          
        int i2 = 0;
      	while(a[i2] >= sum2) {
          i2++;
          if(i2 >= N) break;
        }
      	
      	if (i2 >= M)
            System.out.println("Yes");
        else
            System.out.println("No");
        }
    }
} Main public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int M = sc.nextInt();
      
      	if(N == 1) {
          System.out.println("Yes");
        }
        
        else {
      	Integer a[] = new Integer[N];
      	for (int i=0; i<N; i++) {
            a[i] = sc.nextInt();
        }
        Arrays.sort(a, Comparator.reverseOrder());
      
      	double sum = 0;
        for (int i=0; i<N; i++) {
          sum += a[i];
        }
      
      	double sum2 = sum * 1 / (4 * M);
          
        int i2 = 0;
      	while(a[i2] >= sum2) {
          i2++;
          if(i2 >= N) break;
        }
      	
      	if (i2 >= M)
            System.out.println("Yes");
        else
            System.out.println("No");
        }
    } main {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int M = sc.nextInt();
      
      	if(N == 1) {
          System.out.println("Yes");
        }
        
        else {
      	Integer a[] = new Integer[N];
      	for (int i=0; i<N; i++) {
            a[i] = sc.nextInt();
        }
        Arrays.sort(a, Comparator.reverseOrder());
      
      	double sum = 0;
        for (int i=0; i<N; i++) {
          sum += a[i];
        }
      
      	double sum2 = sum * 1 / (4 * M);
          
        int i2 = 0;
      	while(a[i2] >= sum2) {
          i2++;
          if(i2 >= N) break;
        }
      	
      	if (i2 >= M)
            System.out.println("Yes");
        else
            System.out.println("No");
        }
    } Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int N = sc.nextInt(); N sc.nextInt() sc.nextInt sc int M = sc.nextInt(); M sc.nextInt() sc.nextInt sc if(N == 1) {
          System.out.println("Yes");
        }
        
        else {
      	Integer a[] = new Integer[N];
      	for (int i=0; i<N; i++) {
            a[i] = sc.nextInt();
        }
        Arrays.sort(a, Comparator.reverseOrder());
      
      	double sum = 0;
        for (int i=0; i<N; i++) {
          sum += a[i];
        }
      
      	double sum2 = sum * 1 / (4 * M);
          
        int i2 = 0;
      	while(a[i2] >= sum2) {
          i2++;
          if(i2 >= N) break;
        }
      	
      	if (i2 >= M)
            System.out.println("Yes");
        else
            System.out.println("No");
        } N == 1 N 1 {
          System.out.println("Yes");
        } System.out.println("Yes") System.out.println System.out System System.out "Yes" {
      	Integer a[] = new Integer[N];
      	for (int i=0; i<N; i++) {
            a[i] = sc.nextInt();
        }
        Arrays.sort(a, Comparator.reverseOrder());
      
      	double sum = 0;
        for (int i=0; i<N; i++) {
          sum += a[i];
        }
      
      	double sum2 = sum * 1 / (4 * M);
          
        int i2 = 0;
      	while(a[i2] >= sum2) {
          i2++;
          if(i2 >= N) break;
        }
      	
      	if (i2 >= M)
            System.out.println("Yes");
        else
            System.out.println("No");
        } Integer a[] = new Integer[N]; a new Integer[N] N for (int i=0; i<N; i++) {
            a[i] = sc.nextInt();
        } int i=0; int i=0; i 0 i<N i N i++ i++ i {
            a[i] = sc.nextInt();
        } {
            a[i] = sc.nextInt();
        } a[i] = sc.nextInt() a[i] a i sc.nextInt() sc.nextInt sc Arrays.sort(a, Comparator.reverseOrder()) Arrays.sort Arrays a Comparator.reverseOrder() Comparator.reverseOrder Comparator double sum = 0; sum 0 for (int i=0; i<N; i++) {
          sum += a[i];
        } int i=0; int i=0; i 0 i<N i N i++ i++ i {
          sum += a[i];
        } {
          sum += a[i];
        } sum += a[i] sum a[i] a i double sum2 = sum * 1 / (4 * M); sum2 sum * 1 / (4 * M) sum * 1 sum 1 (4 * M) 4 M int i2 = 0; i2 0 while(a[i2] >= sum2) {
          i2++;
          if(i2 >= N) break;
        } a[i2] >= sum2 a[i2] a i2 sum2 {
          i2++;
          if(i2 >= N) break;
        } i2++ i2 if(i2 >= N) break; i2 >= N i2 N break; if (i2 >= M)
            System.out.println("Yes");
        else
            System.out.println("No"); i2 >= M i2 M System.out.println("Yes") System.out.println System.out System System.out "Yes" System.out.println("No") System.out.println System.out System System.out "No" String[] args args
import java.util.*;

class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int M = sc.nextInt();
      
      	if(N == 1) {
          System.out.println("Yes");
        }
        
        else {
      	Integer a[] = new Integer[N];
      	for (int i=0; i<N; i++) {
            a[i] = sc.nextInt();
        }
        Arrays.sort(a, Comparator.reverseOrder());
      
      	double sum = 0;
        for (int i=0; i<N; i++) {
          sum += a[i];
        }
      
      	double sum2 = sum * 1 / (4 * M);
          
        int i2 = 0;
      	while(a[i2] >= sum2) {
          i2++;
          if(i2 >= N) break;
        }
      	
      	if (i2 >= M)
            System.out.println("Yes");
        else
            System.out.println("No");
        }
    }
}