import java.util.*;

class Main{
  //QuickSort
	static void swap(int[] a, int idx1, int idx2){
 		int t = a[idx1]; a[idx1] = a[idx2]; a[idx2] = t;
	}

	static void quickSort(int[] a, int left, int right){
  		int pl = left;
  		int pr = right;
  		int x  = a[(pl+pr)/2];

  		do{
    		while (a[pl] < x) pl++;
    		while (a[pr] > x) pr--;
    		if(pl <= pr)
       			swap(a, pl++, pr--);
  		}while(pl <= pr);

  		if(left < pr) quickSort(a,left,pr);
  		if(pl < right) quickSort(a,pl,right);
	}
  
  
  public static void main(String[] args){
    Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    int M = sc.nextInt();
    int[] A = new int[N];
    int sum_vote = 0;
    for(int i = 0; i < N; i++){
      A[i] = sc.nextInt();
      sum_vote += A[i];
    }
	
    //昇順に並び替え
    quickSort(A,0,N-1);
    
    int count = 0;
    int judge = 0;
    for(int i = N-1; i >= 0; i--){
      if ( A[i]*4*M >= sum_vote)
        count++;
      if(count == M){
        judge = 1;
        break;
      }
    }
    
    if ( judge == 0)
      System.out.println("No");
    else
      System.out.println("Yes");
    
  }
} import java.util.*; util.* java class Main{
  //QuickSort
	static void swap(int[] a, int idx1, int idx2){
 		int t = a[idx1]; a[idx1] = a[idx2]; a[idx2] = t;
	}

	static void quickSort(int[] a, int left, int right){
  		int pl = left;
  		int pr = right;
  		int x  = a[(pl+pr)/2];

  		do{
    		while (a[pl] < x) pl++;
    		while (a[pr] > x) pr--;
    		if(pl <= pr)
       			swap(a, pl++, pr--);
  		}while(pl <= pr);

  		if(left < pr) quickSort(a,left,pr);
  		if(pl < right) quickSort(a,pl,right);
	}
  
  
  public static void main(String[] args){
    Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    int M = sc.nextInt();
    int[] A = new int[N];
    int sum_vote = 0;
    for(int i = 0; i < N; i++){
      A[i] = sc.nextInt();
      sum_vote += A[i];
    }
	
    //昇順に並び替え
    quickSort(A,0,N-1);
    
    int count = 0;
    int judge = 0;
    for(int i = N-1; i >= 0; i--){
      if ( A[i]*4*M >= sum_vote)
        count++;
      if(count == M){
        judge = 1;
        break;
      }
    }
    
    if ( judge == 0)
      System.out.println("No");
    else
      System.out.println("Yes");
    
  }
} Main //QuickSort
	static void swap(int[] a, int idx1, int idx2){
 		int t = a[idx1]; a[idx1] = a[idx2]; a[idx2] = t;
	} swap {
 		int t = a[idx1]; a[idx1] = a[idx2]; a[idx2] = t;
	} int t = a[idx1]; t a[idx1] a idx1 a[idx1] = a[idx2] a[idx1] a idx1 a[idx2] a idx2 a[idx2] = t a[idx2] a idx2 t int[] a a int idx1 idx1 int idx2 idx2 static void quickSort(int[] a, int left, int right){
  		int pl = left;
  		int pr = right;
  		int x  = a[(pl+pr)/2];

  		do{
    		while (a[pl] < x) pl++;
    		while (a[pr] > x) pr--;
    		if(pl <= pr)
       			swap(a, pl++, pr--);
  		}while(pl <= pr);

  		if(left < pr) quickSort(a,left,pr);
  		if(pl < right) quickSort(a,pl,right);
	} quickSort {
  		int pl = left;
  		int pr = right;
  		int x  = a[(pl+pr)/2];

  		do{
    		while (a[pl] < x) pl++;
    		while (a[pr] > x) pr--;
    		if(pl <= pr)
       			swap(a, pl++, pr--);
  		}while(pl <= pr);

  		if(left < pr) quickSort(a,left,pr);
  		if(pl < right) quickSort(a,pl,right);
	} int pl = left; pl left int pr = right; pr right int x  = a[(pl+pr)/2]; x a[(pl+pr)/2] a (pl+pr)/2 (pl+pr) pl pr 2 do{
    		while (a[pl] < x) pl++;
    		while (a[pr] > x) pr--;
    		if(pl <= pr)
       			swap(a, pl++, pr--);
  		}while(pl <= pr); pl <= pr pl pr {
    		while (a[pl] < x) pl++;
    		while (a[pr] > x) pr--;
    		if(pl <= pr)
       			swap(a, pl++, pr--);
  		} while (a[pl] < x) pl++; a[pl] < x a[pl] a pl x pl++ pl while (a[pr] > x) pr--; a[pr] > x a[pr] a pr x pr-- pr if(pl <= pr)
       			swap(a, pl++, pr--); pl <= pr pl pr swap(a, pl++, pr--) swap a pl++ pl pr-- pr if(left < pr) quickSort(a,left,pr); left < pr left pr quickSort(a,left,pr) quickSort a left pr if(pl < right) quickSort(a,pl,right); pl < right pl right quickSort(a,pl,right) quickSort a pl right int[] a a int left left int right right public static void main(String[] args){
    Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    int M = sc.nextInt();
    int[] A = new int[N];
    int sum_vote = 0;
    for(int i = 0; i < N; i++){
      A[i] = sc.nextInt();
      sum_vote += A[i];
    }
	
    //昇順に並び替え
    quickSort(A,0,N-1);
    
    int count = 0;
    int judge = 0;
    for(int i = N-1; i >= 0; i--){
      if ( A[i]*4*M >= sum_vote)
        count++;
      if(count == M){
        judge = 1;
        break;
      }
    }
    
    if ( judge == 0)
      System.out.println("No");
    else
      System.out.println("Yes");
    
  } main {
    Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    int M = sc.nextInt();
    int[] A = new int[N];
    int sum_vote = 0;
    for(int i = 0; i < N; i++){
      A[i] = sc.nextInt();
      sum_vote += A[i];
    }
	
    //昇順に並び替え
    quickSort(A,0,N-1);
    
    int count = 0;
    int judge = 0;
    for(int i = N-1; i >= 0; i--){
      if ( A[i]*4*M >= sum_vote)
        count++;
      if(count == M){
        judge = 1;
        break;
      }
    }
    
    if ( judge == 0)
      System.out.println("No");
    else
      System.out.println("Yes");
    
  } 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 int[] A = new int[N]; A new int[N] N int sum_vote = 0; sum_vote 0 for(int i = 0; i < N; i++){
      A[i] = sc.nextInt();
      sum_vote += A[i];
    } int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
      A[i] = sc.nextInt();
      sum_vote += A[i];
    } {
      A[i] = sc.nextInt();
      sum_vote += A[i];
    } A[i] = sc.nextInt() A[i] A i sc.nextInt() sc.nextInt sc sum_vote += A[i] sum_vote A[i] A i quickSort(A,0,N-1) quickSort A 0 N-1 N 1 int count = 0; count 0 int judge = 0; judge 0 for(int i = N-1; i >= 0; i--){
      if ( A[i]*4*M >= sum_vote)
        count++;
      if(count == M){
        judge = 1;
        break;
      }
    } int i = N-1; int i = N-1; i N-1 N 1 i >= 0 i 0 i-- i-- i {
      if ( A[i]*4*M >= sum_vote)
        count++;
      if(count == M){
        judge = 1;
        break;
      }
    } {
      if ( A[i]*4*M >= sum_vote)
        count++;
      if(count == M){
        judge = 1;
        break;
      }
    } if ( A[i]*4*M >= sum_vote)
        count++; A[i]*4*M >= sum_vote A[i]*4*M A[i]*4*M A[i] A i 4 M sum_vote count++ count if(count == M){
        judge = 1;
        break;
      } count == M count M {
        judge = 1;
        break;
      } judge = 1 judge 1 break; if ( judge == 0)
      System.out.println("No");
    else
      System.out.println("Yes"); judge == 0 judge 0 System.out.println("No") System.out.println System.out System System.out "No" System.out.println("Yes") System.out.println System.out System System.out "Yes" String[] args args
import java.util.*;

class Main{
  //QuickSort
	static void swap(int[] a, int idx1, int idx2){
 		int t = a[idx1]; a[idx1] = a[idx2]; a[idx2] = t;
	}

	static void quickSort(int[] a, int left, int right){
  		int pl = left;
  		int pr = right;
  		int x  = a[(pl+pr)/2];

  		do{
    		while (a[pl] < x) pl++;
    		while (a[pr] > x) pr--;
    		if(pl <= pr)
       			swap(a, pl++, pr--);
  		}while(pl <= pr);

  		if(left < pr) quickSort(a,left,pr);
  		if(pl < right) quickSort(a,pl,right);
	}
  
  
  public static void main(String[] args){
    Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    int M = sc.nextInt();
    int[] A = new int[N];
    int sum_vote = 0;
    for(int i = 0; i < N; i++){
      A[i] = sc.nextInt();
      sum_vote += A[i];
    }
	
    //昇順に並び替え
    quickSort(A,0,N-1);
    
    int count = 0;
    int judge = 0;
    for(int i = N-1; i >= 0; i--){
      if ( A[i]*4*M >= sum_vote)
        count++;
      if(count == M){
        judge = 1;
        break;
      }
    }
    
    if ( judge == 0)
      System.out.println("No");
    else
      System.out.println("Yes");
    
  }
}
