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 C# (Mono 4.6.2.0) (judge verdict: Accepted)

using System;
using System.Collections.Generic;
using System.Linq;

namespace ConsoleApp
{
    class Program
    {
        static void Main(string[] args)
        {
            var input = Console.ReadLine().Split(' ').Select(int.Parse).ToList();
            var n = input[0];
            var k = input[1];
            var h = Console.ReadLine().Split(' ').Select(int.Parse).OrderByDescending(s => s).ToList();
            Func<int, bool> judge = i => h[i] >= k;

            var ans = judge(0) ? SearchLast(judge, 0, n - 1) + 1 : 0;
            Console.WriteLine(ans);
        }

        public static int SearchLast(Func<int, bool> f, int min, int max)
        {
            if (f(max)) return max;
            var k = min + (max - min) / 2;

            return f(k) ? SearchLast(f, k, max - 1) : SearchLast(f, min, k);
        }
    }
}