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 cons[] = new int[n];
        long allCount = 0;

        for (int i = 0; i < cons.length; i++) {
            cons[i] = sc.nextInt();
            allCount += cons[i];
        }

        Arrays.sort(cons);

        int count = 0;
        for (int i = 0; i < m; i++) {
            if (cons[n-1-i] >= allCount / (4.0 * m)) {
                count++;
            }
        }

        String flg = "No";
        if (count == m) {
            flg = "Yes";
        }
        System.out.println(flg);
    }
} 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 cons[] = new int[n];
        long allCount = 0;

        for (int i = 0; i < cons.length; i++) {
            cons[i] = sc.nextInt();
            allCount += cons[i];
        }

        Arrays.sort(cons);

        int count = 0;
        for (int i = 0; i < m; i++) {
            if (cons[n-1-i] >= allCount / (4.0 * m)) {
                count++;
            }
        }

        String flg = "No";
        if (count == m) {
            flg = "Yes";
        }
        System.out.println(flg);
    }
} Main public static void main(String[] args){

        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int m = sc.nextInt();

        int cons[] = new int[n];
        long allCount = 0;

        for (int i = 0; i < cons.length; i++) {
            cons[i] = sc.nextInt();
            allCount += cons[i];
        }

        Arrays.sort(cons);

        int count = 0;
        for (int i = 0; i < m; i++) {
            if (cons[n-1-i] >= allCount / (4.0 * m)) {
                count++;
            }
        }

        String flg = "No";
        if (count == m) {
            flg = "Yes";
        }
        System.out.println(flg);
    } main {

        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int m = sc.nextInt();

        int cons[] = new int[n];
        long allCount = 0;

        for (int i = 0; i < cons.length; i++) {
            cons[i] = sc.nextInt();
            allCount += cons[i];
        }

        Arrays.sort(cons);

        int count = 0;
        for (int i = 0; i < m; i++) {
            if (cons[n-1-i] >= allCount / (4.0 * m)) {
                count++;
            }
        }

        String flg = "No";
        if (count == m) {
            flg = "Yes";
        }
        System.out.println(flg);
    } 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 cons[] = new int[n]; cons new int[n] n long allCount = 0; allCount 0 for (int i = 0; i < cons.length; i++) {
            cons[i] = sc.nextInt();
            allCount += cons[i];
        } int i = 0; int i = 0; i 0 i < cons.length i cons.length cons cons.length i++ i++ i {
            cons[i] = sc.nextInt();
            allCount += cons[i];
        } {
            cons[i] = sc.nextInt();
            allCount += cons[i];
        } cons[i] = sc.nextInt() cons[i] cons i sc.nextInt() sc.nextInt sc allCount += cons[i] allCount cons[i] cons i Arrays.sort(cons) Arrays.sort Arrays cons int count = 0; count 0 for (int i = 0; i < m; i++) {
            if (cons[n-1-i] >= allCount / (4.0 * m)) {
                count++;
            }
        } int i = 0; int i = 0; i 0 i < m i m i++ i++ i {
            if (cons[n-1-i] >= allCount / (4.0 * m)) {
                count++;
            }
        } {
            if (cons[n-1-i] >= allCount / (4.0 * m)) {
                count++;
            }
        } if (cons[n-1-i] >= allCount / (4.0 * m)) {
                count++;
            } cons[n-1-i] >= allCount / (4.0 * m) cons[n-1-i] cons n-1-i n-1-i n 1 i allCount / (4.0 * m) allCount (4.0 * m) 4.0 m {
                count++;
            } count++ count String flg = "No"; flg "No" if (count == m) {
            flg = "Yes";
        } count == m count m {
            flg = "Yes";
        } flg = "Yes" flg "Yes" System.out.println(flg) System.out.println System.out System System.out flg 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 cons[] = new int[n];
        long allCount = 0;

        for (int i = 0; i < cons.length; i++) {
            cons[i] = sc.nextInt();
            allCount += cons[i];
        }

        Arrays.sort(cons);

        int count = 0;
        for (int i = 0; i < m; i++) {
            if (cons[n-1-i] >= allCount / (4.0 * m)) {
                count++;
            }
        }

        String flg = "No";
        if (count == m) {
            flg = "Yes";
        }
        System.out.println(flg);
    }
} public class Main {
    public static void main(String[] args){

        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int m = sc.nextInt();

        int cons[] = new int[n];
        long allCount = 0;

        for (int i = 0; i < cons.length; i++) {
            cons[i] = sc.nextInt();
            allCount += cons[i];
        }

        Arrays.sort(cons);

        int count = 0;
        for (int i = 0; i < m; i++) {
            if (cons[n-1-i] >= allCount / (4.0 * m)) {
                count++;
            }
        }

        String flg = "No";
        if (count == m) {
            flg = "Yes";
        }
        System.out.println(flg);
    }
} 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 cons[] = new int[n];
        long allCount = 0;

        for (int i = 0; i < cons.length; i++) {
            cons[i] = sc.nextInt();
            allCount += cons[i];
        }

        Arrays.sort(cons);

        int count = 0;
        for (int i = 0; i < m; i++) {
            if (cons[n-1-i] >= allCount / (4.0 * m)) {
                count++;
            }
        }

        String flg = "No";
        if (count == m) {
            flg = "Yes";
        }
        System.out.println(flg);
    }
}