//package atcoder;
 
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();
		//System.out.println(M);
		
		int A[] = new int [N];
		for(int i=0;i<N;i++) {
			A[i] = sc.nextInt();
		}
		double sum = 0.0;
		for(int j=0;j<N;j++) {
			sum += A[j];
		}
		//System.out.println(sum);
		boolean ok[] = new boolean[N];
		Arrays.fill(ok, true);
		double hantei = sum/(4*M);
		for(int k=0;k<N;k++) {
			if(A[k]<hantei) {
				ok[k] = false;
			}
		}
		int count = 0;
		for(int l=0;l<N;l++) {
			if(ok[l]) {
				count ++;
			}
		}
		//System.out.println(count);
		if(count>=M) {
			System.out.println("Yes");
		}else {
			System.out.println("No");
		}
	}
} 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();
		//System.out.println(M);
		
		int A[] = new int [N];
		for(int i=0;i<N;i++) {
			A[i] = sc.nextInt();
		}
		double sum = 0.0;
		for(int j=0;j<N;j++) {
			sum += A[j];
		}
		//System.out.println(sum);
		boolean ok[] = new boolean[N];
		Arrays.fill(ok, true);
		double hantei = sum/(4*M);
		for(int k=0;k<N;k++) {
			if(A[k]<hantei) {
				ok[k] = false;
			}
		}
		int count = 0;
		for(int l=0;l<N;l++) {
			if(ok[l]) {
				count ++;
			}
		}
		//System.out.println(count);
		if(count>=M) {
			System.out.println("Yes");
		}else {
			System.out.println("No");
		}
	}
} Main public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int M = sc.nextInt();
		//System.out.println(M);
		
		int A[] = new int [N];
		for(int i=0;i<N;i++) {
			A[i] = sc.nextInt();
		}
		double sum = 0.0;
		for(int j=0;j<N;j++) {
			sum += A[j];
		}
		//System.out.println(sum);
		boolean ok[] = new boolean[N];
		Arrays.fill(ok, true);
		double hantei = sum/(4*M);
		for(int k=0;k<N;k++) {
			if(A[k]<hantei) {
				ok[k] = false;
			}
		}
		int count = 0;
		for(int l=0;l<N;l++) {
			if(ok[l]) {
				count ++;
			}
		}
		//System.out.println(count);
		if(count>=M) {
			System.out.println("Yes");
		}else {
			System.out.println("No");
		}
	} main {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int M = sc.nextInt();
		//System.out.println(M);
		
		int A[] = new int [N];
		for(int i=0;i<N;i++) {
			A[i] = sc.nextInt();
		}
		double sum = 0.0;
		for(int j=0;j<N;j++) {
			sum += A[j];
		}
		//System.out.println(sum);
		boolean ok[] = new boolean[N];
		Arrays.fill(ok, true);
		double hantei = sum/(4*M);
		for(int k=0;k<N;k++) {
			if(A[k]<hantei) {
				ok[k] = false;
			}
		}
		int count = 0;
		for(int l=0;l<N;l++) {
			if(ok[l]) {
				count ++;
			}
		}
		//System.out.println(count);
		if(count>=M) {
			System.out.println("Yes");
		}else {
			System.out.println("No");
		}
	} 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 for(int i=0;i<N;i++) {
			A[i] = sc.nextInt();
		} int i=0; int i=0; i 0 i<N i N i++ i++ i {
			A[i] = sc.nextInt();
		} {
			A[i] = sc.nextInt();
		} A[i] = sc.nextInt() A[i] A i sc.nextInt() sc.nextInt sc double sum = 0.0; sum 0.0 for(int j=0;j<N;j++) {
			sum += A[j];
		} int j=0; int j=0; j 0 j<N j N j++ j++ j {
			sum += A[j];
		} {
			sum += A[j];
		} sum += A[j] sum A[j] A j boolean ok[] = new boolean[N]; ok new boolean[N] N Arrays.fill(ok, true) Arrays.fill Arrays ok true double hantei = sum/(4*M); hantei sum/(4*M) sum (4*M) 4 M for(int k=0;k<N;k++) {
			if(A[k]<hantei) {
				ok[k] = false;
			}
		} int k=0; int k=0; k 0 k<N k N k++ k++ k {
			if(A[k]<hantei) {
				ok[k] = false;
			}
		} {
			if(A[k]<hantei) {
				ok[k] = false;
			}
		} if(A[k]<hantei) {
				ok[k] = false;
			} A[k]<hantei A[k] A k hantei {
				ok[k] = false;
			} ok[k] = false ok[k] ok k false int count = 0; count 0 for(int l=0;l<N;l++) {
			if(ok[l]) {
				count ++;
			}
		} int l=0; int l=0; l 0 l<N l N l++ l++ l {
			if(ok[l]) {
				count ++;
			}
		} {
			if(ok[l]) {
				count ++;
			}
		} if(ok[l]) {
				count ++;
			} ok[l] ok l {
				count ++;
			} count ++ count if(count>=M) {
			System.out.println("Yes");
		}else {
			System.out.println("No");
		} count>=M count M {
			System.out.println("Yes");
		} System.out.println("Yes") System.out.println System.out System System.out "Yes" {
			System.out.println("No");
		} System.out.println("No") System.out.println System.out System System.out "No" 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();
		//System.out.println(M);
		
		int A[] = new int [N];
		for(int i=0;i<N;i++) {
			A[i] = sc.nextInt();
		}
		double sum = 0.0;
		for(int j=0;j<N;j++) {
			sum += A[j];
		}
		//System.out.println(sum);
		boolean ok[] = new boolean[N];
		Arrays.fill(ok, true);
		double hantei = sum/(4*M);
		for(int k=0;k<N;k++) {
			if(A[k]<hantei) {
				ok[k] = false;
			}
		}
		int count = 0;
		for(int l=0;l<N;l++) {
			if(ok[l]) {
				count ++;
			}
		}
		//System.out.println(count);
		if(count>=M) {
			System.out.println("Yes");
		}else {
			System.out.println("No");
		}
	}
} public class Main{
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int M = sc.nextInt();
		//System.out.println(M);
		
		int A[] = new int [N];
		for(int i=0;i<N;i++) {
			A[i] = sc.nextInt();
		}
		double sum = 0.0;
		for(int j=0;j<N;j++) {
			sum += A[j];
		}
		//System.out.println(sum);
		boolean ok[] = new boolean[N];
		Arrays.fill(ok, true);
		double hantei = sum/(4*M);
		for(int k=0;k<N;k++) {
			if(A[k]<hantei) {
				ok[k] = false;
			}
		}
		int count = 0;
		for(int l=0;l<N;l++) {
			if(ok[l]) {
				count ++;
			}
		}
		//System.out.println(count);
		if(count>=M) {
			System.out.println("Yes");
		}else {
			System.out.println("No");
		}
	}
} Main
//package atcoder;
 
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();
		//System.out.println(M);
		
		int A[] = new int [N];
		for(int i=0;i<N;i++) {
			A[i] = sc.nextInt();
		}
		double sum = 0.0;
		for(int j=0;j<N;j++) {
			sum += A[j];
		}
		//System.out.println(sum);
		boolean ok[] = new boolean[N];
		Arrays.fill(ok, true);
		double hantei = sum/(4*M);
		for(int k=0;k<N;k++) {
			if(A[k]<hantei) {
				ok[k] = false;
			}
		}
		int count = 0;
		for(int l=0;l<N;l++) {
			if(ok[l]) {
				count ++;
			}
		}
		//System.out.println(count);
		if(count>=M) {
			System.out.println("Yes");
		}else {
			System.out.println("No");
		}
	}
}