import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int M = sc.nextInt();
        int[] A = new int[N];
        int total = 0;
        double kijun = 1 / (double)(4 * M);
        
        //Aに格納
        for(int i = 0; i < N; i++){
            A[i] = sc.nextInt();
            total += A[i];
        }
        
        //昇順にソート
        int maxidx = 0;
        int w = 0;
        for(int i = 0; i < N; i++){
            maxidx = i;
            w = A[i];
            for(int j = i+1; j < N; j++) {
                if(A[maxidx] < A[j]) {
                    maxidx = j;
                }
            }
            A[i] = A[maxidx];
            A[maxidx] = w;
        }
        
        //判定
        String ans = "Yes";
        for(int i = 0; i < M; i++) {
            if(A[i] < kijun * total) {
                ans = "No";
            }
        }
        
        System.out.println(ans);
        
    }
} import java.util.*; util.* java public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int M = sc.nextInt();
        int[] A = new int[N];
        int total = 0;
        double kijun = 1 / (double)(4 * M);
        
        //Aに格納
        for(int i = 0; i < N; i++){
            A[i] = sc.nextInt();
            total += A[i];
        }
        
        //昇順にソート
        int maxidx = 0;
        int w = 0;
        for(int i = 0; i < N; i++){
            maxidx = i;
            w = A[i];
            for(int j = i+1; j < N; j++) {
                if(A[maxidx] < A[j]) {
                    maxidx = j;
                }
            }
            A[i] = A[maxidx];
            A[maxidx] = w;
        }
        
        //判定
        String ans = "Yes";
        for(int i = 0; i < M; i++) {
            if(A[i] < kijun * total) {
                ans = "No";
            }
        }
        
        System.out.println(ans);
        
    }
} Main public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int M = sc.nextInt();
        int[] A = new int[N];
        int total = 0;
        double kijun = 1 / (double)(4 * M);
        
        //Aに格納
        for(int i = 0; i < N; i++){
            A[i] = sc.nextInt();
            total += A[i];
        }
        
        //昇順にソート
        int maxidx = 0;
        int w = 0;
        for(int i = 0; i < N; i++){
            maxidx = i;
            w = A[i];
            for(int j = i+1; j < N; j++) {
                if(A[maxidx] < A[j]) {
                    maxidx = j;
                }
            }
            A[i] = A[maxidx];
            A[maxidx] = w;
        }
        
        //判定
        String ans = "Yes";
        for(int i = 0; i < M; i++) {
            if(A[i] < kijun * total) {
                ans = "No";
            }
        }
        
        System.out.println(ans);
        
    } main {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int M = sc.nextInt();
        int[] A = new int[N];
        int total = 0;
        double kijun = 1 / (double)(4 * M);
        
        //Aに格納
        for(int i = 0; i < N; i++){
            A[i] = sc.nextInt();
            total += A[i];
        }
        
        //昇順にソート
        int maxidx = 0;
        int w = 0;
        for(int i = 0; i < N; i++){
            maxidx = i;
            w = A[i];
            for(int j = i+1; j < N; j++) {
                if(A[maxidx] < A[j]) {
                    maxidx = j;
                }
            }
            A[i] = A[maxidx];
            A[maxidx] = w;
        }
        
        //判定
        String ans = "Yes";
        for(int i = 0; i < M; i++) {
            if(A[i] < kijun * total) {
                ans = "No";
            }
        }
        
        System.out.println(ans);
        
    } Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int N = sc.nextInt(); N sc.nextInt() sc.nextInt sc int M = sc.nextInt(); M sc.nextInt() sc.nextInt sc int[] A = new int[N]; A new int[N] N int total = 0; total 0 double kijun = 1 / (double)(4 * M); kijun 1 / (double)(4 * M) 1 (double)(4 * M) 4 M for(int i = 0; i < N; i++){
            A[i] = sc.nextInt();
            total += A[i];
        } int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
            A[i] = sc.nextInt();
            total += A[i];
        } {
            A[i] = sc.nextInt();
            total += A[i];
        } A[i] = sc.nextInt() A[i] A i sc.nextInt() sc.nextInt sc total += A[i] total A[i] A i int maxidx = 0; maxidx 0 int w = 0; w 0 for(int i = 0; i < N; i++){
            maxidx = i;
            w = A[i];
            for(int j = i+1; j < N; j++) {
                if(A[maxidx] < A[j]) {
                    maxidx = j;
                }
            }
            A[i] = A[maxidx];
            A[maxidx] = w;
        } int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
            maxidx = i;
            w = A[i];
            for(int j = i+1; j < N; j++) {
                if(A[maxidx] < A[j]) {
                    maxidx = j;
                }
            }
            A[i] = A[maxidx];
            A[maxidx] = w;
        } {
            maxidx = i;
            w = A[i];
            for(int j = i+1; j < N; j++) {
                if(A[maxidx] < A[j]) {
                    maxidx = j;
                }
            }
            A[i] = A[maxidx];
            A[maxidx] = w;
        } maxidx = i maxidx i w = A[i] w A[i] A i for(int j = i+1; j < N; j++) {
                if(A[maxidx] < A[j]) {
                    maxidx = j;
                }
            } int j = i+1; int j = i+1; j i+1 i 1 j < N j N j++ j++ j {
                if(A[maxidx] < A[j]) {
                    maxidx = j;
                }
            } {
                if(A[maxidx] < A[j]) {
                    maxidx = j;
                }
            } if(A[maxidx] < A[j]) {
                    maxidx = j;
                } A[maxidx] < A[j] A[maxidx] A maxidx A[j] A j {
                    maxidx = j;
                } maxidx = j maxidx j A[i] = A[maxidx] A[i] A i A[maxidx] A maxidx A[maxidx] = w A[maxidx] A maxidx w String ans = "Yes"; ans "Yes" for(int i = 0; i < M; i++) {
            if(A[i] < kijun * total) {
                ans = "No";
            }
        } int i = 0; int i = 0; i 0 i < M i M i++ i++ i {
            if(A[i] < kijun * total) {
                ans = "No";
            }
        } {
            if(A[i] < kijun * total) {
                ans = "No";
            }
        } if(A[i] < kijun * total) {
                ans = "No";
            } A[i] < kijun * total A[i] A i kijun * total kijun total {
                ans = "No";
            } ans = "No" ans "No" System.out.println(ans) System.out.println System.out System System.out ans String[] args args public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int M = sc.nextInt();
        int[] A = new int[N];
        int total = 0;
        double kijun = 1 / (double)(4 * M);
        
        //Aに格納
        for(int i = 0; i < N; i++){
            A[i] = sc.nextInt();
            total += A[i];
        }
        
        //昇順にソート
        int maxidx = 0;
        int w = 0;
        for(int i = 0; i < N; i++){
            maxidx = i;
            w = A[i];
            for(int j = i+1; j < N; j++) {
                if(A[maxidx] < A[j]) {
                    maxidx = j;
                }
            }
            A[i] = A[maxidx];
            A[maxidx] = w;
        }
        
        //判定
        String ans = "Yes";
        for(int i = 0; i < M; i++) {
            if(A[i] < kijun * total) {
                ans = "No";
            }
        }
        
        System.out.println(ans);
        
    }
} public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int M = sc.nextInt();
        int[] A = new int[N];
        int total = 0;
        double kijun = 1 / (double)(4 * M);
        
        //Aに格納
        for(int i = 0; i < N; i++){
            A[i] = sc.nextInt();
            total += A[i];
        }
        
        //昇順にソート
        int maxidx = 0;
        int w = 0;
        for(int i = 0; i < N; i++){
            maxidx = i;
            w = A[i];
            for(int j = i+1; j < N; j++) {
                if(A[maxidx] < A[j]) {
                    maxidx = j;
                }
            }
            A[i] = A[maxidx];
            A[maxidx] = w;
        }
        
        //判定
        String ans = "Yes";
        for(int i = 0; i < M; i++) {
            if(A[i] < kijun * total) {
                ans = "No";
            }
        }
        
        System.out.println(ans);
        
    }
} Main
import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int M = sc.nextInt();
        int[] A = new int[N];
        int total = 0;
        double kijun = 1 / (double)(4 * M);
        
        //Aに格納
        for(int i = 0; i < N; i++){
            A[i] = sc.nextInt();
            total += A[i];
        }
        
        //昇順にソート
        int maxidx = 0;
        int w = 0;
        for(int i = 0; i < N; i++){
            maxidx = i;
            w = A[i];
            for(int j = i+1; j < N; j++) {
                if(A[maxidx] < A[j]) {
                    maxidx = j;
                }
            }
            A[i] = A[maxidx];
            A[maxidx] = w;
        }
        
        //判定
        String ans = "Yes";
        for(int i = 0; i < M; i++) {
            if(A[i] < kijun * total) {
                ans = "No";
            }
        }
        
        System.out.println(ans);
        
    }
}
