Roller Coaster

AtCoder

IDabc142_b

Time2000ms

Memory256MB

Difficulty—

$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$ [samples]

Samples

Input #1

4 150
150 140 100 200

Output #1

2

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

Input #2

1 500
499

Output #2

Input #3

5 1
100 200 300 400 500

Output #3

API Response (JSON)

{
  "problem": {
    "name": "Roller Coaster",
    "description": {
      "content": "$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 man",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc142_b"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "$N$ friends of Takahashi has come to a theme park.\nTo ride the most popular roller coaster in the park, you must be at least $K$ centimeters tall.\nThe $i$\\-th friend is $h_i$ centimeters tall.\nHow man...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments