CT842

The Above Threshold of the Wistful readings

EasyL2 · Byte BanditAcceptance: 0.0%XP: 10

Caravans arrive at the poppy fields of Scarlet Plain with crates of readings, and Sarla the auditor must account for every last one. 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 <= 82; -100 <= a[i],t <= 1000000.

Example 1:

Input: 23 116591 892881 942524 215977 208132 311771 117034 804267 611908 420248 867819 661066 280935 774764 329537 310338 816523 493198 993984 214632 515764 259409 498643 655789
Output: 23

Example 2:

Input: 69 19128 331026 636692 89720 289844 724739 353106 533637 910796 544432 633011 867105 944709 755350 441429 718101 443789 629020 541229 210672 809215 810891 960369 568719 479773 46822 204412 816071 959513 746328 344550 612784 601038 549145 664306 971905 721451 265190 907648 910149 454700 994709 448394 621037 631768 735417 543657 419737 783893 531219 609528 970958 740550 536265 764911 418403 967976 922811 75398 984166 606701 697684 572450 126949 609712 674142 304703 247466 903605 986461
Output: 69

Example 3:

Input: 73 497142 631718 636499 218755 100001 232915 297103 230772 236112 577061 148294 621843 683652 427013 571669 703968 908325 874884 71545 43801 541850 39826 47224 859417 330955 478089 488119 768366 736233 959222 555286 304444 464201 727341 325144 362355 869660 534743 817731 440907 301702 747475 817516 552955 511346 625539 894748 715669 513277 966190 421269 883471 358064 494215 852310 103753 817710 724275 934088 562246 389357 70002 87995 311822 161818 185743 880958 660917 886680 20555 115540 286765 976216 587359
Output: 39

Constraints:

1 <= n <= 82; -100 <= a[i],t <= 1000000.

Loading...
Test Cases:No test cases
No test cases available.