CT47004

The beacons K-th So Far Puzzle

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

At the thorn maze of Bramblecourt, Owen records each beacons in a worn leather ledger. The guild wants answers, not guesses. 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: 1921 1763 -270879292 -186685795 342921312 -873238414 -174563800 -934521464 -550089601 -208447477 90687434 590702402 -620256483 382952857 640076853 -838153420 -871374888 87047953 -739491952 -725865341 849230656 -64855042 30638243 -593267758 -672656292 926936169 -689961372 24202079 267154111 -89861593 -510133740 131579189 -242348535 -205967774 -772497463 982033629 416177196 268650526 -888581121 837662573 1910816 870582448 634666594 -849226916 -687768877 -253408240 -433793080 -29801137 -176954303 654686791 -962244450 28218106 711037727 -205239117 488328088 691278396 124510549 -662932951 793760768 138071706 703049462 -536645678 -357744078 296328617 -850641909 608998563 488323971 -603103771 367270733 -349205300 -447772376 -111510095 814809544 -487310450 -328478005 -90500483 -276548508 317215421…
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: 1828 283 136475883 -269747805 305779733 842117304 -968295241 -461160302 310571297 -288941550 755401385 781369307 258622560 -80186398 932088759 -917408554 -988508181 231565776 -815327897 772260703 -218307662 -212806165 616150851 648422048 821637978 -406390450 -319447996 377637233 893307853 -582009570 -698385314 394931465 4318389 765171263 537720473 582450455 521116520 -226083442 -582443343 374518486 764108900 -235449202 -230993260 -928995304 -265349487 -962924156 428109164 80659681 -496491388 19302700 -732089073 -587428655 -975420451 -599843989 -860409331 -564323920 -135676001 698432407 -397605481 -890391650 662423945 107009439 -809314942 -41043921 182895955 563475153 -865400580 -759535590 90948231 -132843961 -555686879 -695528435 -260321426 919891441 -36048233 16183340 -307151559 814144585…
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: 3423 1699 243866937 988693673 -395751422 844225889 -143973855 -458731538 201250781 990115972 821592226 -201369277 -931692585 15571091 346211543 -729683125 236100116 -51333190 679977 954491252 -970033528 173210574 -261774370 -744039536 -117897595 744290563 361358434 -300188248 363638750 339384760 -815554131 769327884 62445100 -859946042 -888294198 843406439 187145890 -538843175 474607617 527555533 572536545 -893935051 -205717836 652357389 636541266 -694454157 -379031361 413710641 824029097 -712895078 -519552165 983650697 738866159 -305923624 500450968 759575068 844738990 122673168 -430076255 372247517 181674699 -450519405 309883609 -751615355 -162088011 -704847281 345346481 969978510 243137477 -428345758 -660325514 -870576964 956800320 908941487 -483725379 -149015163 155875577 724020174 639…
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.
The beacons K-th So Far Puzzle - MEDIUM Coding Problem | CodeTikki