Problem:
Score : 200 points

Problem Statement

N friends of Takahashi has come to a theme park.

To ride the most popular roller coaster in the park, you must be at least K centimeters tall.

The i-th friend is h_i centimeters tall.

How many of the Takahashi's friends can ride the roller coaster?

Constraints

1 \le N \le 10^5

1 \le K \le 500

1 \le h_i \le 500

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N K
h_1 h_2 \ldots h_N

Output

Print the number of people among the Takahashi's friends who can ride the roller coaster.

Sample Input 1

4 150
150 140 100 200

Sample Output 1

2

Two of them can ride the roller coaster: the first and fourth friends.

Sample Input 2

1 500
499

Sample Output 2

0

Sample Input 3

5 1
100 200 300 400 500

Sample Output 3

5

Solution in Python (3.4.3) (judge verdict: Wrong Answer)

n, k = map(int, input().split())
l = list(map(int, input().split()))
l.sort()

if 1 == len(l):
    if l[0] >= k:
        print(1)
    else:
        print(0)
    exit()
elif l[0] >= k:
    print(n)
    exit()
elif l[n-1] < k:
    print(0)
    exit()
        
min_suffix = 0
max_suffix = n-1

i = (min_suffix + max_suffix) // 2
while True:
    if max_suffix - min_suffix > 1:
        if l[i] < k:
            min_suffix = i
        elif l[i] > k:
            max_suffix = i
        else:
            print(n-i)
            exit()
        i = (min_suffix + max_suffix) // 2
    else:
        print(n-min_suffix)
        exit()