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++14 (GCC 5.4.1) (judge verdict: Accepted)

#include <stdio.h>
#include <bits/stdc++.h>
using namespace std;


int binarySearch(vector<int> v,int right,int left,int k){
    if(right > left){
        int mid  = left + (right - left) / 2;
        if(v[mid] == k)
            return mid;
        
        if(v[mid] > k)
            return binarySearch(v,mid-1,left,k);
            
        return binarySearch(v,right,mid+1,k);
    }
    if(right < 0)
        return 0;
    else if (left > v.size()-1)
        return v.size()-1;
    else 
        return (left < right) ? left : right;
}

int main(int argc, char **argv)
{
    int n,k,h,counter = 0;
    vector<int> heights;
    cin>>n>>k;
    for(int i = 0;i < n;i++){
        cin>>h;
        if(h >= k) counter++;
    }
    cout<<counter;
//    sort(heights.begin(),heights.end());
//    int index = binarySearch(heights,n-1,0,k);
//    cout<<n-index;
    
	return 0;
}