CT38608

The K-th So Far at Stonehallow

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Every season at the granite steps of Stonehallow, someone must assign crews to the morning shifts. This year the task falls to Dante, armed only with the signals register. Task: As values arrive one by one, after each arrival print the k-th largest seen so far, or -1 while fewer than k values exist. Input format: First line: n and k. Second line: n integers. Output format: Print n answers space-separated. Constraints: 1 <= k <= n <= 4000; -10^9 <= a[i] <= 10^9.

Example 1:

Input: 1612 1261 871024198 -230299130 148885737 -223964452 101870478 -194698669 638479120 573786448 -89817559 -647545239 514778355 307925167 -784072928 -227882992 298916360 9828241 -187918554 305981891 -133889283 879721788 -887842042 745987337 833150119 -716603029 -586631254 -412433187 838989470 851153203 -50281418 730667768 -158594560 398566135 -956344541 574214976 623562715 624917442 -370307149 78253162 -935468109 -571210511 627900776 -660276763 735992021 305919677 -429577072 117368813 216513090 -832849532 484841525 -935968290 63799364 208001196 -758617059 410924645 781275411 14061571 -998694234 -788357210 -827664144 -981094495 -98036575 -183176282 466888730 -24496722 -57404424 479095968 -380347777 111040576 -820950966 -509051544 -177158493 -106758126 835437334 234719899 723004709 638567324 -53…
Output: -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1…

Example 2:

Input: 3888 1505 -900972095 720475326 -435224967 381451670 -382360561 843115534 955218721 -940470115 580528042 -659720577 -60028119 -856930695 837467626 619271228 349232224 -724157789 867365980 -600234471 -27065013 -186818596 -170431074 809121801 -307433496 -402306119 -568208129 493291990 904351712 -312305914 174728944 -930107856 860000950 641111701 -597296505 -738285250 -855806000 -327474859 -434816721 -103924848 684412689 -801364243 494963613 -194102846 748682773 -289389630 -589656475 -95592621 168524827 -33767019 -690034606 558316419 792673792 805540640 -872719712 284766949 -865526874 -734325532 83413896 352790562 797954939 197187653 -278004819 -243010714 846265421 -750295038 916419028 53843635 -725177491 -488379961 328857695 35973194 363338384 -465385859 -515793337 392694449 969347480 -803008…
Output: -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1…

Example 3:

Input: 221 149 -882134553 501414844 841893211 -838402380 -381771348 305589278 655496100 211294216 -207839766 -309045968 -154892545 -201370463 -202935689 -16582894 -893881542 -452112217 -636006858 338195270 245744598 431639647 385699491 -97368702 391670084 5236633 -597197749 -83371354 -199666185 -495074540 -462582447 227177191 -659953513 -751371277 508588106 -370201429 -901056318 955475275 143390448 -78090607 -416601636 -862270397 37771552 258686687 315664161 395195608 -180964569 723727326 -198895372 795993493 671398825 -393445134 900306493 -618017169 711750985 149822310 437228744 56620540 17019117 -351763891 -735420562 -645566469 -700515438 -296291088 605439285 -433504488 -640287878 81429121 -938975647 557824410 612835616 -876161355 -361655962 -745188568 109940562 -786769431 -749727653 -846619174…
Output: -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -990234624 -956347170 -938975647 -907964735 -906863362 -906863362 -903032735 -902281399 -901056318 -893881542 -887789349 -887789349 -882134553 -876161355 -862270397 -858508515 -846619174 -838402380 -796875836 -796875836 -786769431 -786769431 -756560954 -751371277 -749727653 -745188568 -736047276 -736047276 -735420562 -721053686 -716287950 -700515438 -689…

Constraints:

1 <= k <= n <= 4000; -10^9 <= a[i] <= 10^9.

Loading...
Test Cases:No test cases
No test cases available.
The K-th So Far at Stonehallow - MEDIUM Coding Problem | CodeTikki