CT28463

Vesper's Ledger of scrolls

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

The harbor bell rings at the smokehouses of Brineport; Vesper weighs the day's scrolls manifests and starts the calculations. 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 <= 911; -1000000 <= a[i],t <= 1000.

Example 1:

Input: 64 -309638 -152353 -809207 -756406 -661204 -335375 -220419 -355517 -987656 -265229 -937279 -613038 -783477 -122372 -731370 -272746 -680985 -883343 -891914 -198959 -74097 -864504 -394985 -705807 -723868 -46479 -683363 -19174 -198984 -338006 -762215 -947739 -517248 -443013 -613733 -894805 373 -913466 -23888 -868491 -462254 -681145 -786475 -432798 -95500 -638331 -627809 -89373 -375287 -20608 -61820 -912818 -333397 -212026 -482915 -536242 -622968 -547271 -648192 -428391 -819388 -586466 -993794 -286928 -283254
Output: 19

Example 2:

Input: 151 -676351 -212478 -257544 -712429 -636568 -579991 -825610 -267686 -975978 -920204 -613388 -652195 -851699 -381520 -314805 -62453 -760262 -706738 -714131 -482606 -481935 -611789 -652399 -87479 -781118 -338281 -283125 -769949 -195152 -448767 -208810 -490124 -907167 -703562 -916898 -329864 -22404 -6680 -225428 -185880 -391137 -907823 -454360 -653406 -787724 -579068 -856649 -480009 -815929 -893239 -224283 -21766 -846899 -113885 -523724 -610329 -502641 -865056 -371351 -841870 -704865 -800924 -817025 -989209 -802157 -286473 -750939 -144502 -293533 -289212 -273419 -960761 -243909 -794023 -356388 -148787 -170556 -728490 -667769 -864098 -383025 -281140 -336859 -77018 -644489 -700173 -648445 -842126 -619161 -603084 -98477 -457278 -574958 -392545 -963761 -931066 -217107 -272785 -453123 -607877 -108…
Output: 101

Example 3:

Input: 637 -374667 -265837 -956641 -412067 -309449 -934029 -694994 -575207 -810900 -489224 -98051 -756473 -621585 -119488 -782055 -1608 -208312 -865955 -759082 -841365 -249868 -467456 -370142 -907654 -296104 -57018 -634456 -909609 -493284 -33487 -206973 -634712 -392924 -461650 -807063 -572794 -675341 -448909 -943959 -145926 -538049 -448633 -95776 -17468 -457190 -306844 -278071 -148877 -339328 -745969 -937960 -884818 -735925 -22933 -756539 -904121 -442041 -421320 -36070 -944245 -264728 -458121 -630644 -939868 -217710 -426509 -961322 -358179 -990707 -881422 -203949 -695491 -91212 -623574 -472852 -223953 -77762 -700973 -106585 -844135 -351999 -308583 -848129 -66035 -725063 -312681 -741661 -365416 -160456 -970337 -493723 -795026 -252354 -922298 -691869 -199746 -846662 -204916 -163318 -946520 -880944 …
Output: 231

Constraints:

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

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