import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		int N;
		long M;
		Scanner sc = new Scanner(System.in);
		N = sc.nextInt();
		M = sc.nextInt();
		long[] a = new long[(int) N];
		double check = 0;
		for (int i = 0; i < N; i++) {
			a[i] = sc.nextLong();
			check += a[i];
		}
		;
		check = check / (4 *M);
		int count = 0;
		while (N - 1 >= 0) {
			count += (a[N - 1] >= check) ? 1 : 0;
			N--;
		}
		System.out.println(count >= M ? "Yes" : "No");
	}
} import java.util.Scanner; Scanner java.util public class Main {
	public static void main(String[] args) {
		int N;
		long M;
		Scanner sc = new Scanner(System.in);
		N = sc.nextInt();
		M = sc.nextInt();
		long[] a = new long[(int) N];
		double check = 0;
		for (int i = 0; i < N; i++) {
			a[i] = sc.nextLong();
			check += a[i];
		}
		;
		check = check / (4 *M);
		int count = 0;
		while (N - 1 >= 0) {
			count += (a[N - 1] >= check) ? 1 : 0;
			N--;
		}
		System.out.println(count >= M ? "Yes" : "No");
	}
} Main public static void main(String[] args) {
		int N;
		long M;
		Scanner sc = new Scanner(System.in);
		N = sc.nextInt();
		M = sc.nextInt();
		long[] a = new long[(int) N];
		double check = 0;
		for (int i = 0; i < N; i++) {
			a[i] = sc.nextLong();
			check += a[i];
		}
		;
		check = check / (4 *M);
		int count = 0;
		while (N - 1 >= 0) {
			count += (a[N - 1] >= check) ? 1 : 0;
			N--;
		}
		System.out.println(count >= M ? "Yes" : "No");
	} main {
		int N;
		long M;
		Scanner sc = new Scanner(System.in);
		N = sc.nextInt();
		M = sc.nextInt();
		long[] a = new long[(int) N];
		double check = 0;
		for (int i = 0; i < N; i++) {
			a[i] = sc.nextLong();
			check += a[i];
		}
		;
		check = check / (4 *M);
		int count = 0;
		while (N - 1 >= 0) {
			count += (a[N - 1] >= check) ? 1 : 0;
			N--;
		}
		System.out.println(count >= M ? "Yes" : "No");
	} int N; N long M; M Scanner sc = new Scanner(System.in); sc new Scanner(System.in) N = sc.nextInt() N sc.nextInt() sc.nextInt sc M = sc.nextInt() M sc.nextInt() sc.nextInt sc long[] a = new long[(int) N]; a new long[(int) N] (int) N double check = 0; check 0 for (int i = 0; i < N; i++) {
			a[i] = sc.nextLong();
			check += a[i];
		} int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
			a[i] = sc.nextLong();
			check += a[i];
		} {
			a[i] = sc.nextLong();
			check += a[i];
		} a[i] = sc.nextLong() a[i] a i sc.nextLong() sc.nextLong sc check += a[i] check a[i] a i check = check / (4 *M) check check / (4 *M) check (4 *M) 4 M int count = 0; count 0 while (N - 1 >= 0) {
			count += (a[N - 1] >= check) ? 1 : 0;
			N--;
		} N - 1 >= 0 N - 1 N 1 0 {
			count += (a[N - 1] >= check) ? 1 : 0;
			N--;
		} count += (a[N - 1] >= check) ? 1 : 0 count (a[N - 1] >= check) ? 1 : 0 (a[N - 1] >= check) a[N - 1] a N - 1 N 1 check 1 0 N-- N System.out.println(count >= M ? "Yes" : "No") System.out.println System.out System System.out count >= M ? "Yes" : "No" count >= M count M "Yes" "No" String[] args args public class Main {
	public static void main(String[] args) {
		int N;
		long M;
		Scanner sc = new Scanner(System.in);
		N = sc.nextInt();
		M = sc.nextInt();
		long[] a = new long[(int) N];
		double check = 0;
		for (int i = 0; i < N; i++) {
			a[i] = sc.nextLong();
			check += a[i];
		}
		;
		check = check / (4 *M);
		int count = 0;
		while (N - 1 >= 0) {
			count += (a[N - 1] >= check) ? 1 : 0;
			N--;
		}
		System.out.println(count >= M ? "Yes" : "No");
	}
} public class Main {
	public static void main(String[] args) {
		int N;
		long M;
		Scanner sc = new Scanner(System.in);
		N = sc.nextInt();
		M = sc.nextInt();
		long[] a = new long[(int) N];
		double check = 0;
		for (int i = 0; i < N; i++) {
			a[i] = sc.nextLong();
			check += a[i];
		}
		;
		check = check / (4 *M);
		int count = 0;
		while (N - 1 >= 0) {
			count += (a[N - 1] >= check) ? 1 : 0;
			N--;
		}
		System.out.println(count >= M ? "Yes" : "No");
	}
} Main
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		int N;
		long M;
		Scanner sc = new Scanner(System.in);
		N = sc.nextInt();
		M = sc.nextInt();
		long[] a = new long[(int) N];
		double check = 0;
		for (int i = 0; i < N; i++) {
			a[i] = sc.nextLong();
			check += a[i];
		}
		;
		check = check / (4 *M);
		int count = 0;
		while (N - 1 >= 0) {
			count += (a[N - 1] >= check) ? 1 : 0;
			N--;
		}
		System.out.println(count >= M ? "Yes" : "No");
	}
}