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

public class Main {

    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);

        int n = Integer.parseInt(scan.next());
        int m = Integer.parseInt(scan.next());

        Integer[] a = new Integer[n];
        for (int i = 0; i < n; i++) {
            a[i] = Integer.parseInt(scan.next());
        }

        scan.close();

        int sum = 0;
        for (int i : a) {
            sum += i;
        }

        int border = (sum + (4 * m) - 1) / (4 * m);

        Arrays.sort(a, Collections.reverseOrder());

        if (a[m - 1] >= border) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }

    }

} import java.util.Arrays; Arrays java.util import java.util.Collections; Collections java.util import java.util.Scanner; Scanner java.util public class Main {

    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);

        int n = Integer.parseInt(scan.next());
        int m = Integer.parseInt(scan.next());

        Integer[] a = new Integer[n];
        for (int i = 0; i < n; i++) {
            a[i] = Integer.parseInt(scan.next());
        }

        scan.close();

        int sum = 0;
        for (int i : a) {
            sum += i;
        }

        int border = (sum + (4 * m) - 1) / (4 * m);

        Arrays.sort(a, Collections.reverseOrder());

        if (a[m - 1] >= border) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }

    }

} Main public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);

        int n = Integer.parseInt(scan.next());
        int m = Integer.parseInt(scan.next());

        Integer[] a = new Integer[n];
        for (int i = 0; i < n; i++) {
            a[i] = Integer.parseInt(scan.next());
        }

        scan.close();

        int sum = 0;
        for (int i : a) {
            sum += i;
        }

        int border = (sum + (4 * m) - 1) / (4 * m);

        Arrays.sort(a, Collections.reverseOrder());

        if (a[m - 1] >= border) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }

    } main {
        Scanner scan = new Scanner(System.in);

        int n = Integer.parseInt(scan.next());
        int m = Integer.parseInt(scan.next());

        Integer[] a = new Integer[n];
        for (int i = 0; i < n; i++) {
            a[i] = Integer.parseInt(scan.next());
        }

        scan.close();

        int sum = 0;
        for (int i : a) {
            sum += i;
        }

        int border = (sum + (4 * m) - 1) / (4 * m);

        Arrays.sort(a, Collections.reverseOrder());

        if (a[m - 1] >= border) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }

    } Scanner scan = new Scanner(System.in); scan new Scanner(System.in) int n = Integer.parseInt(scan.next()); n Integer.parseInt(scan.next()) Integer.parseInt Integer scan.next() scan.next scan int m = Integer.parseInt(scan.next()); m Integer.parseInt(scan.next()) Integer.parseInt Integer scan.next() scan.next scan Integer[] a = new Integer[n]; a new Integer[n] n for (int i = 0; i < n; i++) {
            a[i] = Integer.parseInt(scan.next());
        } int i = 0; int i = 0; i 0 i < n i n i++ i++ i {
            a[i] = Integer.parseInt(scan.next());
        } {
            a[i] = Integer.parseInt(scan.next());
        } a[i] = Integer.parseInt(scan.next()) a[i] a i Integer.parseInt(scan.next()) Integer.parseInt Integer scan.next() scan.next scan scan.close() scan.close scan int sum = 0; sum 0 for (int i : a) {
            sum += i;
        } int i a {
            sum += i;
        } {
            sum += i;
        } sum += i sum i int border = (sum + (4 * m) - 1) / (4 * m); border (sum + (4 * m) - 1) / (4 * m) (sum + (4 * m) - 1) sum + (4 * m) sum (4 * m) 4 m 1 (4 * m) 4 m Arrays.sort(a, Collections.reverseOrder()) Arrays.sort Arrays a Collections.reverseOrder() Collections.reverseOrder Collections if (a[m - 1] >= border) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        } a[m - 1] >= border a[m - 1] a m - 1 m 1 border {
            System.out.println("Yes");
        } System.out.println("Yes") System.out.println System.out System System.out "Yes" {
            System.out.println("No");
        } 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 scan = new Scanner(System.in);

        int n = Integer.parseInt(scan.next());
        int m = Integer.parseInt(scan.next());

        Integer[] a = new Integer[n];
        for (int i = 0; i < n; i++) {
            a[i] = Integer.parseInt(scan.next());
        }

        scan.close();

        int sum = 0;
        for (int i : a) {
            sum += i;
        }

        int border = (sum + (4 * m) - 1) / (4 * m);

        Arrays.sort(a, Collections.reverseOrder());

        if (a[m - 1] >= border) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }

    }

} public class Main {

    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);

        int n = Integer.parseInt(scan.next());
        int m = Integer.parseInt(scan.next());

        Integer[] a = new Integer[n];
        for (int i = 0; i < n; i++) {
            a[i] = Integer.parseInt(scan.next());
        }

        scan.close();

        int sum = 0;
        for (int i : a) {
            sum += i;
        }

        int border = (sum + (4 * m) - 1) / (4 * m);

        Arrays.sort(a, Collections.reverseOrder());

        if (a[m - 1] >= border) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }

    }

} Main
import java.util.Arrays;
import java.util.Collections;
import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);

        int n = Integer.parseInt(scan.next());
        int m = Integer.parseInt(scan.next());

        Integer[] a = new Integer[n];
        for (int i = 0; i < n; i++) {
            a[i] = Integer.parseInt(scan.next());
        }

        scan.close();

        int sum = 0;
        for (int i : a) {
            sum += i;
        }

        int border = (sum + (4 * m) - 1) / (4 * m);

        Arrays.sort(a, Collections.reverseOrder());

        if (a[m - 1] >= border) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }

    }

}
