import java.util.Arrays;
import java.util.Scanner;

public class Main {
    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];
        double Asum = 0;

        for (int i = 0; i < N; i++) {
            A[i] = sc.nextInt();
            Asum += A[i];
        }

        Asum=Asum/(4*M);

        Arrays.sort(A);

        for (int i = 0; i < M; i++) {
            if(A[A.length-1-i]>=Asum){
                continue;
            }else{
                System.out.println("No");
                System.exit(0);
            }
        }

        System.out.println("Yes");
    }
} import java.util.Arrays; Arrays java.util import java.util.Scanner; Scanner 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();
        int[] A = new int[N];
        double Asum = 0;

        for (int i = 0; i < N; i++) {
            A[i] = sc.nextInt();
            Asum += A[i];
        }

        Asum=Asum/(4*M);

        Arrays.sort(A);

        for (int i = 0; i < M; i++) {
            if(A[A.length-1-i]>=Asum){
                continue;
            }else{
                System.out.println("No");
                System.exit(0);
            }
        }

        System.out.println("Yes");
    }
} Main 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];
        double Asum = 0;

        for (int i = 0; i < N; i++) {
            A[i] = sc.nextInt();
            Asum += A[i];
        }

        Asum=Asum/(4*M);

        Arrays.sort(A);

        for (int i = 0; i < M; i++) {
            if(A[A.length-1-i]>=Asum){
                continue;
            }else{
                System.out.println("No");
                System.exit(0);
            }
        }

        System.out.println("Yes");
    } main {
        Scanner sc = new Scanner(System.in);

        int N = sc.nextInt();
        int M = sc.nextInt();
        int[] A = new int[N];
        double Asum = 0;

        for (int i = 0; i < N; i++) {
            A[i] = sc.nextInt();
            Asum += A[i];
        }

        Asum=Asum/(4*M);

        Arrays.sort(A);

        for (int i = 0; i < M; i++) {
            if(A[A.length-1-i]>=Asum){
                continue;
            }else{
                System.out.println("No");
                System.exit(0);
            }
        }

        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 double Asum = 0; Asum 0 for (int i = 0; i < N; i++) {
            A[i] = sc.nextInt();
            Asum += A[i];
        } int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
            A[i] = sc.nextInt();
            Asum += A[i];
        } {
            A[i] = sc.nextInt();
            Asum += A[i];
        } A[i] = sc.nextInt() A[i] A i sc.nextInt() sc.nextInt sc Asum += A[i] Asum A[i] A i Asum=Asum/(4*M) Asum Asum/(4*M) Asum (4*M) 4 M Arrays.sort(A) Arrays.sort Arrays A for (int i = 0; i < M; i++) {
            if(A[A.length-1-i]>=Asum){
                continue;
            }else{
                System.out.println("No");
                System.exit(0);
            }
        } int i = 0; int i = 0; i 0 i < M i M i++ i++ i {
            if(A[A.length-1-i]>=Asum){
                continue;
            }else{
                System.out.println("No");
                System.exit(0);
            }
        } {
            if(A[A.length-1-i]>=Asum){
                continue;
            }else{
                System.out.println("No");
                System.exit(0);
            }
        } if(A[A.length-1-i]>=Asum){
                continue;
            }else{
                System.out.println("No");
                System.exit(0);
            } A[A.length-1-i]>=Asum A[A.length-1-i] A A.length-1-i A.length-1-i A.length A A.length 1 i Asum {
                continue;
            } continue; {
                System.out.println("No");
                System.exit(0);
            } System.out.println("No") System.out.println System.out System System.out "No" System.exit(0) System.exit System 0 System.out.println("Yes") System.out.println System.out System System.out "Yes" 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();
        int[] A = new int[N];
        double Asum = 0;

        for (int i = 0; i < N; i++) {
            A[i] = sc.nextInt();
            Asum += A[i];
        }

        Asum=Asum/(4*M);

        Arrays.sort(A);

        for (int i = 0; i < M; i++) {
            if(A[A.length-1-i]>=Asum){
                continue;
            }else{
                System.out.println("No");
                System.exit(0);
            }
        }

        System.out.println("Yes");
    }
} public class Main {
    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];
        double Asum = 0;

        for (int i = 0; i < N; i++) {
            A[i] = sc.nextInt();
            Asum += A[i];
        }

        Asum=Asum/(4*M);

        Arrays.sort(A);

        for (int i = 0; i < M; i++) {
            if(A[A.length-1-i]>=Asum){
                continue;
            }else{
                System.out.println("No");
                System.exit(0);
            }
        }

        System.out.println("Yes");
    }
} Main
import java.util.Arrays;
import java.util.Scanner;

public class Main {
    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];
        double Asum = 0;

        for (int i = 0; i < N; i++) {
            A[i] = sc.nextInt();
            Asum += A[i];
        }

        Asum=Asum/(4*M);

        Arrays.sort(A);

        for (int i = 0; i < M; i++) {
            if(A[A.length-1-i]>=Asum){
                continue;
            }else{
                System.out.println("No");
                System.exit(0);
            }
        }

        System.out.println("Yes");
    }
}