HardSorting2000 ms256 MB
Sorted Scores Query
Given scores and a threshold `t`, count how many scores are at least `t`.
Statement
Given scores and a threshold `t`, count how many scores are at least `t`.
Input
First line: `n t`. Second line: `n` integers.
Output
Print the count of scores greater than or equal to `t`.
Constraints
- `1 <= n <= 100000`
Examples
Example 1
Input
6 70
68 71 90 55 70 82Output
4The qualifying scores are 71, 90, 70, and 82.
Sample runs use visible examples. Full submissions are checked securely on the server, and private test cases are not shown in the browser.