import java.util.*;
import java.util.Collections;

class Main{
  public static void main(String[] args){
    Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    double M = sc.nextDouble();
    Double[] A = new Double[N];
    double sum = 0;
    String ret = "Yes";
    for(int i = 0; i < A.length; i++){
      A[i] = sc.nextDouble();
      sum += A[i];
    }
    Arrays.sort(A, Collections.reverseOrder());
    for(int i = 0; i < M; i++){
      if(A[i] < sum / (4 * M)){
        ret = "No";
        break;
      }
    }
    System.out.println(ret);
  }
} import java.util.*; util.* java import java.util.Collections; Collections java.util class Main{
  public static void main(String[] args){
    Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    double M = sc.nextDouble();
    Double[] A = new Double[N];
    double sum = 0;
    String ret = "Yes";
    for(int i = 0; i < A.length; i++){
      A[i] = sc.nextDouble();
      sum += A[i];
    }
    Arrays.sort(A, Collections.reverseOrder());
    for(int i = 0; i < M; i++){
      if(A[i] < sum / (4 * M)){
        ret = "No";
        break;
      }
    }
    System.out.println(ret);
  }
} Main public static void main(String[] args){
    Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    double M = sc.nextDouble();
    Double[] A = new Double[N];
    double sum = 0;
    String ret = "Yes";
    for(int i = 0; i < A.length; i++){
      A[i] = sc.nextDouble();
      sum += A[i];
    }
    Arrays.sort(A, Collections.reverseOrder());
    for(int i = 0; i < M; i++){
      if(A[i] < sum / (4 * M)){
        ret = "No";
        break;
      }
    }
    System.out.println(ret);
  } main {
    Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    double M = sc.nextDouble();
    Double[] A = new Double[N];
    double sum = 0;
    String ret = "Yes";
    for(int i = 0; i < A.length; i++){
      A[i] = sc.nextDouble();
      sum += A[i];
    }
    Arrays.sort(A, Collections.reverseOrder());
    for(int i = 0; i < M; i++){
      if(A[i] < sum / (4 * M)){
        ret = "No";
        break;
      }
    }
    System.out.println(ret);
  } Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int N = sc.nextInt(); N sc.nextInt() sc.nextInt sc double M = sc.nextDouble(); M sc.nextDouble() sc.nextDouble sc Double[] A = new Double[N]; A new Double[N] N double sum = 0; sum 0 String ret = "Yes"; ret "Yes" for(int i = 0; i < A.length; i++){
      A[i] = sc.nextDouble();
      sum += A[i];
    } int i = 0; int i = 0; i 0 i < A.length i A.length A A.length i++ i++ i {
      A[i] = sc.nextDouble();
      sum += A[i];
    } {
      A[i] = sc.nextDouble();
      sum += A[i];
    } A[i] = sc.nextDouble() A[i] A i sc.nextDouble() sc.nextDouble sc sum += A[i] sum A[i] A i Arrays.sort(A, Collections.reverseOrder()) Arrays.sort Arrays A Collections.reverseOrder() Collections.reverseOrder Collections for(int i = 0; i < M; i++){
      if(A[i] < sum / (4 * M)){
        ret = "No";
        break;
      }
    } int i = 0; int i = 0; i 0 i < M i M i++ i++ i {
      if(A[i] < sum / (4 * M)){
        ret = "No";
        break;
      }
    } {
      if(A[i] < sum / (4 * M)){
        ret = "No";
        break;
      }
    } if(A[i] < sum / (4 * M)){
        ret = "No";
        break;
      } A[i] < sum / (4 * M) A[i] A i sum / (4 * M) sum (4 * M) 4 M {
        ret = "No";
        break;
      } ret = "No" ret "No" break; System.out.println(ret) System.out.println System.out System System.out ret String[] args args
import java.util.*;
import java.util.Collections;

class Main{
  public static void main(String[] args){
    Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    double M = sc.nextDouble();
    Double[] A = new Double[N];
    double sum = 0;
    String ret = "Yes";
    for(int i = 0; i < A.length; i++){
      A[i] = sc.nextDouble();
      sum += A[i];
    }
    Arrays.sort(A, Collections.reverseOrder());
    for(int i = 0; i < M; i++){
      if(A[i] < sum / (4 * M)){
        ret = "No";
        break;
      }
    }
    System.out.println(ret);
  }
}
