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

/**
 * 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 * (double) M);
            for (double val : A
            ) {
                if (val >= quort) {
                    count++;
                }
                if (count >= M) {
                    out.println("Yes");
                    return;
                }
            }
            out.println("No");
        }

    }
}
 import java.io.OutputStream; OutputStream java.io import java.io.IOException; IOException java.io import java.io.InputStream; InputStream java.io import java.io.PrintWriter; PrintWriter java.io import java.util.Scanner; Scanner java.util 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 * (double) M);
            for (double val : A
            ) {
                if (val >= quort) {
                    count++;
                }
                if (count >= M) {
                    out.println("Yes");
                    return;
                }
            }
            out.println("No");
        }

    }
} 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();
    } main {
        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();
    } InputStream inputStream = System.in; inputStream System.in System System.in OutputStream outputStream = System.out; outputStream System.out System System.out Scanner in = new Scanner(inputStream); in new Scanner(inputStream) PrintWriter out = new PrintWriter(outputStream); out new PrintWriter(outputStream) abc161_b solver = new abc161_b(); solver new abc161_b() solver.solve(1, in, out) solver.solve solver 1 in out out.close() out.close out String[] args args 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 * (double) M);
            for (double val : A
            ) {
                if (val >= quort) {
                    count++;
                }
                if (count >= M) {
                    out.println("Yes");
                    return;
                }
            }
            out.println("No");
        }

    } 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 * (double) M);
            for (double val : A
            ) {
                if (val >= quort) {
                    count++;
                }
                if (count >= M) {
                    out.println("Yes");
                    return;
                }
            }
            out.println("No");
        } solve {
            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 * (double) M);
            for (double val : A
            ) {
                if (val >= quort) {
                    count++;
                }
                if (count >= M) {
                    out.println("Yes");
                    return;
                }
            }
            out.println("No");
        } int N = in.nextInt(); N in.nextInt() in.nextInt in int M = in.nextInt(); M in.nextInt() in.nextInt in Integer A[] = new Integer[N]; A new Integer[N] N long ttl = 0; ttl 0 for (int i = 0; i < N; i++) {
                A[i] = in.nextInt();
                ttl += A[i];
            } int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
                A[i] = in.nextInt();
                ttl += A[i];
            } {
                A[i] = in.nextInt();
                ttl += A[i];
            } A[i] = in.nextInt() A[i] A i in.nextInt() in.nextInt in ttl += A[i] ttl A[i] A i int count = 0; count 0 double quort = (double) ttl / (4.0 * (double) M); quort (double) ttl / (4.0 * (double) M) (double) ttl (4.0 * (double) M) 4.0 (double) M for (double val : A
            ) {
                if (val >= quort) {
                    count++;
                }
                if (count >= M) {
                    out.println("Yes");
                    return;
                }
            } double val A {
                if (val >= quort) {
                    count++;
                }
                if (count >= M) {
                    out.println("Yes");
                    return;
                }
            } {
                if (val >= quort) {
                    count++;
                }
                if (count >= M) {
                    out.println("Yes");
                    return;
                }
            } if (val >= quort) {
                    count++;
                } val >= quort val quort {
                    count++;
                } count++ count if (count >= M) {
                    out.println("Yes");
                    return;
                } count >= M count M {
                    out.println("Yes");
                    return;
                } out.println("Yes") out.println out "Yes" return; out.println("No") out.println out "No" int testNumber testNumber Scanner in in PrintWriter out out 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 * (double) M);
            for (double val : A
            ) {
                if (val >= quort) {
                    count++;
                }
                if (count >= M) {
                    out.println("Yes");
                    return;
                }
            }
            out.println("No");
        }

    }
} 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 * (double) M);
            for (double val : A
            ) {
                if (val >= quort) {
                    count++;
                }
                if (count >= M) {
                    out.println("Yes");
                    return;
                }
            }
            out.println("No");
        }

    }
} Main
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;

/**
 * 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 * (double) M);
            for (double val : A
            ) {
                if (val >= quort) {
                    count++;
                }
                if (count >= M) {
                    out.println("Yes");
                    return;
                }
            }
            out.println("No");
        }

    }
}

