# Problem B

N, M = list(map(int, input().split()))

A_list = list(map(int, input().split()))



# initialization

a_sum = sum(A_list)

a_limit = a_sum / (4*M)

a_count = 0

is_ok = False



# search

for a in A_list:

    if a>=a_limit:

        a_count += 1



# output

if a_count>=M:

    print("Yes")

else:

    print("No")

# Problem B - Popular Vote



# input

N, M = list(map(int, input().split()))

A_list = list(map(int, input().split()))



# initialization

A_list = sorted(A_list, reverse=True)

is_ok = True

test_limit = sum(A_list) / (4*M)



# check

test_list = A_list[:M]

for t in test_list:

    if t<test_limit:

        is_ok = False

        break



# output

if is_ok:

    print("Yes")

else:

    print("No")

# Problem B
N, M = list(map(int, input().split()))
A_list = list(map(int, input().split()))
# initialization
a_sum = sum(A_list)
a_limit = a_sum / (4 * M)
a_count = 0
is_ok = False
# search
for a in A_list:
    if a >= a_limit:
        a_count += 1
# output
if a_count >= M:
    print("Yes")
else:
    print("No")

# Problem B - Popular Vote
# input
N, M = list(map(int, input().split()))
A_list = list(map(int, input().split()))
# initialization
A_list = sorted(A_list, reverse=True)
is_ok = True
test_limit = sum(A_list) / (4 * M)
# check
test_list = A_list[:M]
for t in test_list:
    if t < test_limit:
        is_ok = False
        break
# output
if is_ok:
    print("Yes")
else:
    print("No")

-# Problem B +# Problem B - Popular Vote +# input -a_sum = sum(A_list) -a_limit = a_sum / (4 * M) -a_count = 0 -is_ok = False -# search -for a in A_list: -    if a >= a_limit: -        a_count += 1 +A_list = sorted(A_list, reverse=True) +is_ok = True +test_limit = sum(A_list) / (4 * M) +# check +test_list = A_list[:M] +for t in test_list: +    if t < test_limit: +        is_ok = False +        break -if a_count >= M: +if is_ok: