CT26269

Cyrus's Tempest readings

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

Cyrus found an old ledger of readings in the kitchen attic at the dune sea of Caravanrest. The margin notes pose a precise question. 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 <= 274; -1000000 <= a[i],t <= 1000.

Example 1:

Input: 131 -586022 -784743 -638354 -385088 -371984 -52607 -192989 -4270 -724147 -208819 -871609 -272384 -281180 -126044 -984613 -415463 -631712 -317582 -281097 -884946 -487680 -744019 -907166 -67734 -615525 -668539 -339529 -468060 -767590 -152194 -569029 -517729 -886632 -127332 -174496 -548646 -807005 -890795 -594119 -251952 -360863 -26443 -172972 -692579 -376568 -491808 -431460 -728072 -869189 -74483 -624130 -491699 -567340 -957263 -552570 -721718 -1749 -358858 -414494 -300177 -485078 -11599 -353435 -590409 -402017 -924685 -773319 -698406 -26442 -150782 -869821 -891161 -675011 -371807 -423471 -150044 -146091 -897534 -175769 -339952 -127240 -468483 -851132 -327575 -16007 -534753 -79574 -579854 -199966 -277505 -391113 -737967 -107469 -928421 -343149 -734500 -133642 -483869 -819101 -850943 -743386 …
Output: 80

Example 2:

Input: 133 -478169 -93443 -233340 -770439 -773860 -664217 -853394 -731082 -94115 -729134 -838058 -222374 -334568 -168347 -71043 -533998 -91904 -325825 -333716 -955952 -254506 -137797 -650144 -499073 -246544 -330077 -221223 -233544 -274171 -122152 -955070 -803406 -523019 -970350 -628855 -868359 -585455 -56014 -804455 -290439 -821959 -845194 -12987 -555874 -84454 -377207 -635794 -201843 -617260 -538532 -686718 -339589 -438105 -636895 -44731 -292194 -999490 -638786 -538499 -21550 -236146 -977361 -283004 -172999 -215036 -178577 -98476 -90484 -762112 -434163 -763957 -723495 -518070 -415070 -899274 -310079 -459395 -649234 -290360 -632112 -98180 -379709 -909407 -652082 -419079 -101063 -189076 -257514 -651 -949472 -309136 -552429 -998906 -269904 -16980 -389855 -756684 -843365 -352113 -301535 -618733 -538…
Output: 69

Example 3:

Input: 25 -14279 -622346 -273905 -693290 -960815 -542381 -83519 -904876 -755839 -429452 -70381 -499226 -654480 -60530 -844361 -648504 -155624 -672878 -445590 -429028 -912775 -240259 -493024 -969819 -452706 -169092
Output: 0

Constraints:

1 <= n <= 274; -1000000 <= a[i],t <= 1000.

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