CT52231

Elio and the Misty beacons

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Legend says the vault under the sulphur springs of Brimstone opens only for a perfect tally of beacons. Elio means to find out. 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: 702 270 561727162 -61928680 -612553908 613141440 -382933829 215545799 284551831 -579728575 -628607697 754753054 -114565541 261426592 -674377335 197682 922975878 -753423081 -726112347 304566653 -400057125 648553393 -533392074 -484091100 794726296 -965703664 -174284634 -921397384 -567175196 228995521 884133772 316040566 865881918 952172014 546088719 -247219025 545274130 848501063 -757370568 917223629 -496367838 -695832442 -801271460 731291518 810219381 -745108481 -372849679 -449378131 -738877549 -647916127 780711531 -10023175 633899641 117944851 604964280 195180547 205629115 611860538 -567285489 96492435 905903675 876064796 -849733624 936020936 154698323 404796412 791281805 -590975988 -622202270 -401422771 -514770206 -980997687 589512012 512302103 566321171 985808129 -95722260 -66368204 -477…
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: 3183 206 186686825 481079978 -797247418 835706722 -123127982 -925734455 -565680158 579591216 462686274 -684899018 171946799 790646449 384566556 378850711 669388535 211311930 42808681 63176359 -389676246 -219753616 147175939 -844293200 956583963 -384880912 -961257186 -33678262 -677353232 -364643967 58486244 692958296 -721312912 834935396 -964048653 9618593 -9021629 -520102469 -549780298 29798517 -717772783 645749867 811522207 -444050498 968613679 -204053314 -213688986 -538109237 -80249451 -368148183 -51033745 -556593200 287498887 707244327 235392204 -562026191 711937442 392421461 -757631925 -400356007 518362140 164307639 79506779 -42222669 496300117 278275848 -783153035 603241011 292920337 921106197 -212497171 -418852725 225174937 939476087 -450563829 158792081 -367136794 988060758 -7193254…
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 -994237326 -990925039 -981975182 -978493208 -965057064 -964048653 -961257186 -926146075 -925734455 -896281254 -882930781 -876109222 -864954604 -852186226 -844293200 -837492801 -82662714…

Example 3:

Input: 2559 2504 902619150 14400798 685656227 -932234344 187482766 -539743338 422238681 -297746029 655160047 22662096 560904823 -681035061 857222753 182657046 912173380 196787611 -712074473 -288945006 748563995 -759053149 737483471 -797839271 -280918048 48413065 -580672865 250542363 790393319 914608752 -515920188 270490089 497096240 -915603075 701537681 996419100 549155922 593371669 924630179 -839071152 165904611 182772865 650116257 272161842 -554425620 -151277736 302178217 -359683787 -926912301 191330485 338006780 -392890354 -411806269 -975138449 445399944 -926628177 579943666 215581031 -217931846 499698191 215620447 790900140 -534157678 320857626 -340100769 -956026327 439790534 -230488931 -686086232 -641093560 548014706 790321943 -804504096 584512916 429481721 -694327056 303406927 836127899 -11…
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.
Elio and the Misty beacons - MEDIUM Coding Problem | CodeTikki