CT48476

Uday Counts the beacons

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Uday inherited the studio at the marble forum of Argentium along with its curious bookkeeping system for beacons. Time to make sense of it. 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: 1212 1072 274040647 436107020 554955150 683802176 620687946 343404660 152707605 -747849557 47904052 -330933199 -783584323 750051091 -266307562 -863311407 -864089028 -723233547 -352769616 -84444921 239462357 683437577 -679780957 -429243188 868859565 -685284400 -65091610 714299907 -857697259 -874076039 580457048 898175824 -136303154 -831964229 181653537 -343852631 584676564 408418685 623175768 918198421 183409053 39703164 -897612486 -276433762 -606903421 -743517659 -113696155 -135072000 -629632857 713729590 554934127 507169425 912465557 968593355 -854135771 515998388 -917815790 -762520110 241540667 -658199097 -661105654 181937194 882613585 -244446764 899274154 9912914 801256453 -145994855 -851266371 -838611929 182739973 933945527 -758513416 919314387 656415217 -830152934 -560985181 -74010150…
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: 2909 1093 914409913 -652983798 791494130 -824789892 442015985 239851048 -215955787 -14647587 -121387657 -878108369 -918135252 996574409 -928439841 -533400495 149575464 -930393221 471331035 -953379843 680767960 817992928 -610676141 408886462 236127574 23256227 490749418 -44411049 -861278632 978900780 -47659855 320148419 -779765739 719393098 603476223 72787165 995365810 308776866 -215134020 415053240 -709745438 -766271239 -944692513 160484226 -75072186 -204319987 -250697805 -980275481 49905669 -266179503 58101250 773216123 -208966950 380060387 -530608661 10894150 476432851 598895131 -476290682 177882949 930033563 465503043 -783934109 285561354 57403606 241318549 959365229 -75762934 -150440808 170846293 909942892 -173252663 -819500071 843166280 -410242627 908219108 -326134030 -155589261 60286…
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: 1766 559 -415455610 102658577 -412185971 -272200870 -702559070 -822105488 475930506 -292038109 971280051 241859208 375274109 562721173 -209083937 -260805782 -997268199 895420492 -561230721 -719762286 -159372584 154246292 870768664 995290555 -985272917 -214438148 -822167199 101017760 41269283 -355784644 887583589 -109781480 -368429357 -987710995 -554272070 -400272428 -419619368 -959407777 245588616 723888081 77265961 -245612682 472866461 -916622488 -709942264 -275668025 -123890560 -754008314 -201314005 511144624 -928510658 -448094546 681223414 -850313597 967766509 -499539157 -918959526 582045710 -983836542 -184932807 954575913 807029483 793005729 49121125 -632673841 274008483 -287506447 60756184 968885147 921129576 697171774 -202161950 -89379182 957376025 210144180 -499294333 998839892 -616…
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…

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Uday Counts the beacons - MEDIUM Coding Problem | CodeTikki