import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;
import java.util.Comparator;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        abc161_b solver = new abc161_b();
        solver.solve(1, in, out);
        out.close();
    }

    static class abc161_b {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int N = in.nextInt();
            int M = in.nextInt();
            Integer A[] = new Integer[N];
            long ttl = 0;
            for (int i = 0; i < N; i++) {
                A[i] = in.nextInt();
                ttl += A[i];
            }

            Arrays.sort(A, Comparator.reverseOrder());
            if (A[M - 1] >= (double) ttl / (4.0 * (double) M)) {
                out.println("Yes");
            } else {
                out.println("No");
            }
        /*
        int count = 0;
        double quort = (double)ttl /(4.0 * M);
        for (double val: A
             ) {
            if (val >= quort) {
                count++;
            }
            if (count >= M) {
                out.println("Yes");
                return;
            }
        }
        out.println("No");
        */

        }

    }
}


/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz