CT48220

Last beacons of Sable

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

At the floating docks of Skyharbor, Sable 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: 1141 880 560141851 105565082 -515831712 849387677 19369936 443168588 -167350996 -965687708 449355914 -930429263 220681806 265324358 -245908956 -240853065 146207233 882727354 468684449 -282914885 918602852 -58978573 981620571 426431377 453982831 427185400 -902867219 588689827 -220585037 -102354078 -253268442 -481638856 690760583 658301186 -548259780 780844303 115982308 950913656 -576177682 -220399675 985742696 -783010646 -175020698 464313565 -78659839 -472099526 -584487108 -813730650 797138585 -621858271 -546096790 367666390 -658639499 284972567 -473751769 -682386553 732580641 467925011 -879618758 169259572 -520868119 -619752683 -870164124 -298854278 835259103 -465331899 -797684728 -971879188 71419941 -299068190 545614642 958182305 -36493893 671433446 -13581615 31822460 -496073224 -52387679…
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: 2328 5 -151527847 -555692425 912303722 -400718099 -731704812 584450635 427154718 280913980 827523055 -455049357 862819123 -356828035 640858507 747068422 -715535397 423179609 -475791126 282561770 -145624561 412169306 175145750 -603586481 982900729 -768125040 -154714851 -537960170 798342416 -376767188 999712675 -204158881 654182088 559806916 686943625 -12864613 -505973148 -440559335 224691271 -924262844 -587242306 692145594 880838627 -356933623 319627742 681550574 -642016448 208907194 -83357637 -314704626 -37567859 -527412682 -834560048 -157684623 -690411955 214632942 -862410152 -299736493 -808131524 589423649 -548782120 900004629 647299416 -513702333 -164009979 -666566107 -426736114 672345800 -712685487 -977198866 -47914467 577734846 885051148 -799638764 -307188268 651962900 -223775429 -532…
Output: -1 -1 -1 -1 -731704812 -555692425 -400718099 -151527847 280913980 280913980 427154718 427154718 584450635 640858507 640858507 640858507 640858507 640858507 640858507 640858507 640858507 640858507 747068422 747068422 747068422 747068422 798342416 798342416 827523055 827523055 827523055 827523055 827523055 827523055 827523055 827523055 827523055 827523055 827523055 827523055 862819123 862819123 862819123 862819123 862819123 862819123 862819123 862819123 862819123 862819123 862819123 862819123 862819123 862819123 862819123 862819123 862819123 862819123 862819123 880838627 880838627 880838627 880838627 880838627 880838627 880838627 880838627 880838627 880838627 880838627 885051148 885051148 885051148 885051148 885051148 885051148 885051148 885051148 885051148 885051148 885051148 885051148 8850…

Example 3:

Input: 3896 580 -149149941 37617089 598859924 -466203649 -394685247 864754084 -600432432 -459659495 579156276 623847352 -540123872 -610881808 -722540727 -570686679 381184336 -635788489 -303566576 754655758 -741383063 429834528 868337568 643989585 827210174 82509175 305636155 -476075228 -450575055 11455337 -279735509 -519673130 978959107 -817492859 885532188 -725173983 -629986405 549016331 648534620 -270947057 -105310808 486805711 681131132 -895330308 110563394 420468972 285554422 307168160 52884428 79661106 -767719700 -735618333 -806705711 -201741221 638561535 317748946 596534826 643933298 586435452 298803533 263028181 419917581 108912368 -918253677 324113112 -797624122 144897541 886111702 448529818 737639055 -683923592 138985351 -208828487 -22545882 -558662865 876857177 100635283 25223241 970032…
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.
Last beacons of Sable - MEDIUM Coding Problem | CodeTikki