TSSPC Contest 2 P1 - Joe's Birds

View as PDF

Submit solution

Points: 3
Time limit: 1.0s
Memory limit: 64M

Author:
Problem type

Joe has exactly N birds, who he loves very much. Joe loves his birds so much that he decided to enter them into a bird flying competition. However, to register a bird into the competition, it must have a minimum flying height of K. Each bird i has a maximum flying height of H_i. Help Joe determine how many birds he is able to enter into the bird flying competition.

Input Specification

The first line of input contains two integers N and K (1 \le N \le 500; 1 \le K \le 50).

The next N lines will each contain a single integer H_i (1 \le H_i \le 50).

Output Specification

Output one line, the total number of birds Joe is can enter into the competition.

Sample Input

10 15
20
4
2
15
8
23
26
2
10
32

Sample Output

5

Comments

There are no comments at the moment.