Deep in the lantern lake of Firefly Mere, Bhavi studies rows of tickets entries. One clean number will settle the guild's oldest argument. Task: Read n integers and a threshold t; print how many exceed t. Input format: First line: n and t. Second line: n space-separated integers. Output format: Print the count of values strictly greater than t. Constraints: 1 <= n <= 226; -100 <= a[i],t <= 1000000.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 226; -100 <= a[i],t <= 1000000.
