import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int N = scanner.nextInt();
        int M = scanner.nextInt();

        Integer[] nums = new Integer[N];
        int sum = 0;
        for (int i = 0; i < nums.length; i++) {
            int a = scanner.nextInt();
            nums[i] = a;
            sum += a;
        }
        scanner.close();

        double limit = sum / (4.0 * M);

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

        if (nums[M - 1] < limit) {
            System.out.println("No");
        } else {
            System.out.println("Yes");
        }

    }
} import java.util.*; util.* java public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int N = scanner.nextInt();
        int M = scanner.nextInt();

        Integer[] nums = new Integer[N];
        int sum = 0;
        for (int i = 0; i < nums.length; i++) {
            int a = scanner.nextInt();
            nums[i] = a;
            sum += a;
        }
        scanner.close();

        double limit = sum / (4.0 * M);

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

        if (nums[M - 1] < limit) {
            System.out.println("No");
        } else {
            System.out.println("Yes");
        }

    }
} Main public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int N = scanner.nextInt();
        int M = scanner.nextInt();

        Integer[] nums = new Integer[N];
        int sum = 0;
        for (int i = 0; i < nums.length; i++) {
            int a = scanner.nextInt();
            nums[i] = a;
            sum += a;
        }
        scanner.close();

        double limit = sum / (4.0 * M);

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

        if (nums[M - 1] < limit) {
            System.out.println("No");
        } else {
            System.out.println("Yes");
        }

    } main {
        Scanner scanner = new Scanner(System.in);
        int N = scanner.nextInt();
        int M = scanner.nextInt();

        Integer[] nums = new Integer[N];
        int sum = 0;
        for (int i = 0; i < nums.length; i++) {
            int a = scanner.nextInt();
            nums[i] = a;
            sum += a;
        }
        scanner.close();

        double limit = sum / (4.0 * M);

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

        if (nums[M - 1] < limit) {
            System.out.println("No");
        } else {
            System.out.println("Yes");
        }

    } Scanner scanner = new Scanner(System.in); scanner new Scanner(System.in) int N = scanner.nextInt(); N scanner.nextInt() scanner.nextInt scanner int M = scanner.nextInt(); M scanner.nextInt() scanner.nextInt scanner Integer[] nums = new Integer[N]; nums new Integer[N] N int sum = 0; sum 0 for (int i = 0; i < nums.length; i++) {
            int a = scanner.nextInt();
            nums[i] = a;
            sum += a;
        } int i = 0; int i = 0; i 0 i < nums.length i nums.length nums nums.length i++ i++ i {
            int a = scanner.nextInt();
            nums[i] = a;
            sum += a;
        } {
            int a = scanner.nextInt();
            nums[i] = a;
            sum += a;
        } int a = scanner.nextInt(); a scanner.nextInt() scanner.nextInt scanner nums[i] = a nums[i] nums i a sum += a sum a scanner.close() scanner.close scanner double limit = sum / (4.0 * M); limit sum / (4.0 * M) sum (4.0 * M) 4.0 M Arrays.sort(nums, Collections.reverseOrder()) Arrays.sort Arrays nums Collections.reverseOrder() Collections.reverseOrder Collections if (nums[M - 1] < limit) {
            System.out.println("No");
        } else {
            System.out.println("Yes");
        } nums[M - 1] < limit nums[M - 1] nums M - 1 M 1 limit {
            System.out.println("No");
        } System.out.println("No") System.out.println System.out System System.out "No" {
            System.out.println("Yes");
        } 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 scanner = new Scanner(System.in);
        int N = scanner.nextInt();
        int M = scanner.nextInt();

        Integer[] nums = new Integer[N];
        int sum = 0;
        for (int i = 0; i < nums.length; i++) {
            int a = scanner.nextInt();
            nums[i] = a;
            sum += a;
        }
        scanner.close();

        double limit = sum / (4.0 * M);

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

        if (nums[M - 1] < limit) {
            System.out.println("No");
        } else {
            System.out.println("Yes");
        }

    }
} public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int N = scanner.nextInt();
        int M = scanner.nextInt();

        Integer[] nums = new Integer[N];
        int sum = 0;
        for (int i = 0; i < nums.length; i++) {
            int a = scanner.nextInt();
            nums[i] = a;
            sum += a;
        }
        scanner.close();

        double limit = sum / (4.0 * M);

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

        if (nums[M - 1] < limit) {
            System.out.println("No");
        } else {
            System.out.println("Yes");
        }

    }
} Main
import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int N = scanner.nextInt();
        int M = scanner.nextInt();

        Integer[] nums = new Integer[N];
        int sum = 0;
        for (int i = 0; i < nums.length; i++) {
            int a = scanner.nextInt();
            nums[i] = a;
            sum += a;
        }
        scanner.close();

        double limit = sum / (4.0 * M);

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

        if (nums[M - 1] < limit) {
            System.out.println("No");
        } else {
            System.out.println("Yes");
        }

    }
}
