CT22250

Xara and the Above Threshold

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

The harbor bell rings at the valley of Misthollow; Xara 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 <= 559; -1000000 <= a[i],t <= 1000.

Example 1:

Input: 79 -967911 -184600 -619898 -950771 -216712 -297726 -238007 -769570 -396888 -472729 -390807 -232003 -402714 -532710 -595660 -746625 -651212 -551149 -16520 -330348 -845345 -435915 -125119 -120466 -141905 -564476 -323475 -865473 -783993 -342622 -487194 -18616 -933076 -445227 -158439 -101050 -35538 -5802 -524381 -246418 -394375 -780434 -328056 -11949 -570468 -284392 -370206 -540283 -844557 -371470 -296152 -439461 -115587 -65193 -753376 -219931 -535707 -804877 -929622 -36277 -265322 -613647 -903987 -912220 -463890 -53236 -374391 -863483 -528159 743 -764182 -436063 -954968 -435423 -36493 -629126 -786135 -234660 -877244 -975647
Output: 78

Example 2:

Input: 248 -826089 -948321 -994846 -604431 -167653 -275785 -929238 -232589 -232507 -703381 -208254 -31060 -472351 -703782 -748572 -475634 -800930 -11691 -446407 -989229 -846025 -574761 -297831 -267803 -184723 -915621 -163054 -429379 -225551 -977112 -729884 -429027 -886750 -889314 -145414 -520151 -923642 -816970 -225169 -135433 -467059 -318500 -337632 -473111 -479401 -578061 -930055 -344284 -883317 -10047 -916752 -405807 -117726 -400075 -7008 -648488 -995709 -538662 -648914 -69762 -380112 -165459 -51023 -360624 -461072 -898267 -778863 -223308 -802621 -767552 -489508 -463730 -936051 -276962 -93495 -693023 -982135 -875147 -666557 -713838 -719939 -503095 -436459 -561310 -157560 -310036 -361487 -569733 -436387 -608198 -735670 -999611 -905536 -926044 -79421 -325123 -400942 -460464 -894296 -253455 -1193…
Output: 208

Example 3:

Input: 335 -316438 -688256 -96887 -393016 -453939 -165102 -152742 -686812 -998063 -112995 -918525 -269590 -721519 -335796 -93155 -462542 -644527 -49664 -732890 -321593 -329878 -822246 -943362 -355482 -137239 -448180 -690941 -701081 -557503 -966469 -782631 -778766 -623330 -990962 -971041 -901800 -51264 -995270 -64651 -444480 -316306 -218089 -25314 -629732 -31750 -24212 -606533 -139463 -527324 -400502 -293161 -851417 -991839 -318409 -989153 -988098 -735558 -48413 -800681 -929666 -544291 -788113 -812908 -927860 -756990 -878579 -896076 -395159 -77628 -993023 -682009 -391971 -885060 -823522 -832792 -153398 -723122 -412044 -933952 -22588 -553445 -449768 -625014 -154937 -346315 -906796 -179105 -160637 -154283 -955572 -457378 -468940 -780634 -811242 -280132 -165504 -747190 -210537 -524430 -887968 -765144…
Output: 99

Constraints:

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

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