import java.util.*;

public class Main{
    public static void main(String[]args){
        Scanner sc =new Scanner(System.in);
        int N=sc.nextInt();
        int M = sc.nextInt();
        Integer A[]=new Integer[N];
        double count=0;
        for(int i=0;i<N;i++){
            A[i]=sc.nextInt();
        
        }
        for(int i=0;i<N;i++){
            count+=A[i];
        }
        double T=0;
        T=count/(4.0*(double)M);
        Arrays.sort(A,Collections.reverseOrder());
        boolean flag = true;
        for(int i=0;i<M;i++){
            if((double)A[i]>=T){
            flag = true;
            }else if((double)A[i]<T){
            flag = false;
            break;
            }
        }
        if(flag==true)
        System.out.println("Yes");
        else if(flag==false)
        System.out.println("No");
    }
} import java.util.*; util.* java public class Main{
    public static void main(String[]args){
        Scanner sc =new Scanner(System.in);
        int N=sc.nextInt();
        int M = sc.nextInt();
        Integer A[]=new Integer[N];
        double count=0;
        for(int i=0;i<N;i++){
            A[i]=sc.nextInt();
        
        }
        for(int i=0;i<N;i++){
            count+=A[i];
        }
        double T=0;
        T=count/(4.0*(double)M);
        Arrays.sort(A,Collections.reverseOrder());
        boolean flag = true;
        for(int i=0;i<M;i++){
            if((double)A[i]>=T){
            flag = true;
            }else if((double)A[i]<T){
            flag = false;
            break;
            }
        }
        if(flag==true)
        System.out.println("Yes");
        else if(flag==false)
        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();
        Integer A[]=new Integer[N];
        double count=0;
        for(int i=0;i<N;i++){
            A[i]=sc.nextInt();
        
        }
        for(int i=0;i<N;i++){
            count+=A[i];
        }
        double T=0;
        T=count/(4.0*(double)M);
        Arrays.sort(A,Collections.reverseOrder());
        boolean flag = true;
        for(int i=0;i<M;i++){
            if((double)A[i]>=T){
            flag = true;
            }else if((double)A[i]<T){
            flag = false;
            break;
            }
        }
        if(flag==true)
        System.out.println("Yes");
        else if(flag==false)
        System.out.println("No");
    } main {
        Scanner sc =new Scanner(System.in);
        int N=sc.nextInt();
        int M = sc.nextInt();
        Integer A[]=new Integer[N];
        double count=0;
        for(int i=0;i<N;i++){
            A[i]=sc.nextInt();
        
        }
        for(int i=0;i<N;i++){
            count+=A[i];
        }
        double T=0;
        T=count/(4.0*(double)M);
        Arrays.sort(A,Collections.reverseOrder());
        boolean flag = true;
        for(int i=0;i<M;i++){
            if((double)A[i]>=T){
            flag = true;
            }else if((double)A[i]<T){
            flag = false;
            break;
            }
        }
        if(flag==true)
        System.out.println("Yes");
        else if(flag==false)
        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 Integer A[]=new Integer[N]; A new Integer[N] N double count=0; count 0 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 for(int i=0;i<N;i++){
            count+=A[i];
        } int i=0; int i=0; i 0 i<N i N i++ i++ i {
            count+=A[i];
        } {
            count+=A[i];
        } count+=A[i] count A[i] A i double T=0; T 0 T=count/(4.0*(double)M) T count/(4.0*(double)M) count (4.0*(double)M) 4.0 (double)M Arrays.sort(A,Collections.reverseOrder()) Arrays.sort Arrays A Collections.reverseOrder() Collections.reverseOrder Collections boolean flag = true; flag true for(int i=0;i<M;i++){
            if((double)A[i]>=T){
            flag = true;
            }else if((double)A[i]<T){
            flag = false;
            break;
            }
        } int i=0; int i=0; i 0 i<M i M i++ i++ i {
            if((double)A[i]>=T){
            flag = true;
            }else if((double)A[i]<T){
            flag = false;
            break;
            }
        } {
            if((double)A[i]>=T){
            flag = true;
            }else if((double)A[i]<T){
            flag = false;
            break;
            }
        } if((double)A[i]>=T){
            flag = true;
            }else if((double)A[i]<T){
            flag = false;
            break;
            } (double)A[i]>=T (double)A[i] A i T {
            flag = true;
            } flag = true flag true if((double)A[i]<T){
            flag = false;
            break;
            } (double)A[i]<T (double)A[i] A i T {
            flag = false;
            break;
            } flag = false flag false break; if(flag==true)
        System.out.println("Yes");
        else if(flag==false)
        System.out.println("No"); flag==true flag true System.out.println("Yes") System.out.println System.out System System.out "Yes" if(flag==false)
        System.out.println("No"); flag==false flag false System.out.println("No") System.out.println System.out System System.out "No" String[]args args public class Main{
    public static void main(String[]args){
        Scanner sc =new Scanner(System.in);
        int N=sc.nextInt();
        int M = sc.nextInt();
        Integer A[]=new Integer[N];
        double count=0;
        for(int i=0;i<N;i++){
            A[i]=sc.nextInt();
        
        }
        for(int i=0;i<N;i++){
            count+=A[i];
        }
        double T=0;
        T=count/(4.0*(double)M);
        Arrays.sort(A,Collections.reverseOrder());
        boolean flag = true;
        for(int i=0;i<M;i++){
            if((double)A[i]>=T){
            flag = true;
            }else if((double)A[i]<T){
            flag = false;
            break;
            }
        }
        if(flag==true)
        System.out.println("Yes");
        else if(flag==false)
        System.out.println("No");
    }
} public class Main{
    public static void main(String[]args){
        Scanner sc =new Scanner(System.in);
        int N=sc.nextInt();
        int M = sc.nextInt();
        Integer A[]=new Integer[N];
        double count=0;
        for(int i=0;i<N;i++){
            A[i]=sc.nextInt();
        
        }
        for(int i=0;i<N;i++){
            count+=A[i];
        }
        double T=0;
        T=count/(4.0*(double)M);
        Arrays.sort(A,Collections.reverseOrder());
        boolean flag = true;
        for(int i=0;i<M;i++){
            if((double)A[i]>=T){
            flag = true;
            }else if((double)A[i]<T){
            flag = false;
            break;
            }
        }
        if(flag==true)
        System.out.println("Yes");
        else if(flag==false)
        System.out.println("No");
    }
} Main
import java.util.*;

public class Main{
    public static void main(String[]args){
        Scanner sc =new Scanner(System.in);
        int N=sc.nextInt();
        int M = sc.nextInt();
        Integer A[]=new Integer[N];
        double count=0;
        for(int i=0;i<N;i++){
            A[i]=sc.nextInt();
        
        }
        for(int i=0;i<N;i++){
            count+=A[i];
        }
        double T=0;
        T=count/(4.0*(double)M);
        Arrays.sort(A,Collections.reverseOrder());
        boolean flag = true;
        for(int i=0;i<M;i++){
            if((double)A[i]>=T){
            flag = true;
            }else if((double)A[i]<T){
            flag = false;
            break;
            }
        }
        if(flag==true)
        System.out.println("Yes");
        else if(flag==false)
        System.out.println("No");
    }
}