CT720

Kian and the Above Threshold

EasyL2 · Byte BanditAcceptance: 0.0%XP: 10

In the otter slides of Sleekwater, Kian the log keeper keeps careful count of the parcels. Plan the festival budget, every figure matters. 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 <= 52; 0 <= a[i],t <= 1000.

Example 1:

Input: 7 390 459 922 382 641 21 344 443
Output: 4

Example 2:

Input: 44 253 275 908 226 583 294 905 966 679 322 236 778 155 775 103 960 683 879 857 537 57 217 383 665 680 417 339 487 971 822 673 36 788 445 380 308 865 819 543 858 212 464 782 960 601
Output: 36

Example 3:

Input: 27 630 35 714 142 515 84 248 931 269 462 200 388 271 677 44 32 225 238 43 173 214 372 780 883 721 949 73 10
Output: 7

Constraints:

1 <= n <= 52; 0 <= a[i],t <= 1000.

Loading...
Test Cases:No test cases
No test cases available.
Kian and the Above Threshold - EASY Coding Problem | CodeTikki