import java.io.IOException;
import java.util.*;

public class Main {

    public static void main(String[] args) throws IOException {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int m = in.nextInt();
        int[] arr = new int[n];
        int sum = 0;

        for (int i = 0; i < n; i++) {
            arr[i] = in.nextInt();
            sum += arr[i];
        }
        Arrays.sort(arr);

        boolean works = true;
        for (int i = n - 1; i > (n-1)-m; i--) {
            if (arr[i] < 1.0 * sum / 4 / m) {
                works = false;
            }
        }
        System.out.println(works ? "Yes" : "No");

    }
} import java.io.IOException; IOException java.io import java.util.*; util.* java public class Main {

    public static void main(String[] args) throws IOException {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int m = in.nextInt();
        int[] arr = new int[n];
        int sum = 0;

        for (int i = 0; i < n; i++) {
            arr[i] = in.nextInt();
            sum += arr[i];
        }
        Arrays.sort(arr);

        boolean works = true;
        for (int i = n - 1; i > (n-1)-m; i--) {
            if (arr[i] < 1.0 * sum / 4 / m) {
                works = false;
            }
        }
        System.out.println(works ? "Yes" : "No");

    }
} Main public static void main(String[] args) throws IOException {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int m = in.nextInt();
        int[] arr = new int[n];
        int sum = 0;

        for (int i = 0; i < n; i++) {
            arr[i] = in.nextInt();
            sum += arr[i];
        }
        Arrays.sort(arr);

        boolean works = true;
        for (int i = n - 1; i > (n-1)-m; i--) {
            if (arr[i] < 1.0 * sum / 4 / m) {
                works = false;
            }
        }
        System.out.println(works ? "Yes" : "No");

    } main {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int m = in.nextInt();
        int[] arr = new int[n];
        int sum = 0;

        for (int i = 0; i < n; i++) {
            arr[i] = in.nextInt();
            sum += arr[i];
        }
        Arrays.sort(arr);

        boolean works = true;
        for (int i = n - 1; i > (n-1)-m; i--) {
            if (arr[i] < 1.0 * sum / 4 / m) {
                works = false;
            }
        }
        System.out.println(works ? "Yes" : "No");

    } Scanner in = new Scanner(System.in); in new Scanner(System.in) int n = in.nextInt(); n in.nextInt() in.nextInt in int m = in.nextInt(); m in.nextInt() in.nextInt in int[] arr = new int[n]; arr new int[n] n int sum = 0; sum 0 for (int i = 0; i < n; i++) {
            arr[i] = in.nextInt();
            sum += arr[i];
        } int i = 0; int i = 0; i 0 i < n i n i++ i++ i {
            arr[i] = in.nextInt();
            sum += arr[i];
        } {
            arr[i] = in.nextInt();
            sum += arr[i];
        } arr[i] = in.nextInt() arr[i] arr i in.nextInt() in.nextInt in sum += arr[i] sum arr[i] arr i Arrays.sort(arr) Arrays.sort Arrays arr boolean works = true; works true for (int i = n - 1; i > (n-1)-m; i--) {
            if (arr[i] < 1.0 * sum / 4 / m) {
                works = false;
            }
        } int i = n - 1; int i = n - 1; i n - 1 n 1 i > (n-1)-m i (n-1)-m (n-1) n 1 m i-- i-- i {
            if (arr[i] < 1.0 * sum / 4 / m) {
                works = false;
            }
        } {
            if (arr[i] < 1.0 * sum / 4 / m) {
                works = false;
            }
        } if (arr[i] < 1.0 * sum / 4 / m) {
                works = false;
            } arr[i] < 1.0 * sum / 4 / m arr[i] arr i 1.0 * sum / 4 / m 1.0 * sum / 4 / m 1.0 * sum 1.0 sum 4 m {
                works = false;
            } works = false works false System.out.println(works ? "Yes" : "No") System.out.println System.out System System.out works ? "Yes" : "No" works "Yes" "No" String[] args args public class Main {

    public static void main(String[] args) throws IOException {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int m = in.nextInt();
        int[] arr = new int[n];
        int sum = 0;

        for (int i = 0; i < n; i++) {
            arr[i] = in.nextInt();
            sum += arr[i];
        }
        Arrays.sort(arr);

        boolean works = true;
        for (int i = n - 1; i > (n-1)-m; i--) {
            if (arr[i] < 1.0 * sum / 4 / m) {
                works = false;
            }
        }
        System.out.println(works ? "Yes" : "No");

    }
} public class Main {

    public static void main(String[] args) throws IOException {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int m = in.nextInt();
        int[] arr = new int[n];
        int sum = 0;

        for (int i = 0; i < n; i++) {
            arr[i] = in.nextInt();
            sum += arr[i];
        }
        Arrays.sort(arr);

        boolean works = true;
        for (int i = n - 1; i > (n-1)-m; i--) {
            if (arr[i] < 1.0 * sum / 4 / m) {
                works = false;
            }
        }
        System.out.println(works ? "Yes" : "No");

    }
} Main
import java.io.IOException;
import java.util.*;

public class Main {

    public static void main(String[] args) throws IOException {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int m = in.nextInt();
        int[] arr = new int[n];
        int sum = 0;

        for (int i = 0; i < n; i++) {
            arr[i] = in.nextInt();
            sum += arr[i];
        }
        Arrays.sort(arr);

        boolean works = true;
        for (int i = n - 1; i > (n-1)-m; i--) {
            if (arr[i] < 1.0 * sum / 4 / m) {
                works = false;
            }
        }
        System.out.println(works ? "Yes" : "No");

    }
}