CT55501

Hestia's Radiant Ledger

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Every season at the mangrove channels of Rootwater, someone must chart the migration season. This year the task falls to Hestia, armed only with the beacons 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: 2463 531 428332114 -43513533 -323216175 -656352859 -462953644 -190789068 378156412 -238384199 -87973621 -177082317 662719906 517525148 239923398 229578951 -955904221 246235642 -110772149 894275460 657733666 9812096 -530331541 399956417 -489833323 938244373 350144103 687190771 48280402 316414417 970294202 -512263995 -980706798 -271365705 903730702 -909224241 657604100 -27312669 -398824815 208175737 -228290469 505629348 -707283872 -528919899 -9130019 652861830 -650297411 550427591 60014277 -452065895 436035416 -281382323 943397858 415637360 592808931 -380756338 -54307756 730085476 87152858 214249687 -639308420 -48838967 909424100 -453267676 876918960 -244009129 -202222498 490635897 711883274 -322566552 -853426735 -220669871 413149251 -706640415 -828418322 -617832406 -5984526 456158956 -40803…
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: 2286 808 273662308 843999781 657996630 826633189 242716177 322261493 -835124827 -116508969 -103471852 552147925 205627872 663401389 272469627 503663789 224569372 -768830719 884420813 78413892 990744723 378045676 850419618 981764005 -981188334 -400416634 930507522 -85982200 264010499 -800680564 -257029500 -132551115 975114375 -314742054 353135484 -38657484 332502990 190570456 161419186 -218978213 -359981088 718646527 341798899 867686336 -930398389 -989140732 204150460 -30889527 -812324630 118636084 811946795 814576645 299201435 25227559 -987676524 -501041113 274253251 -817798021 331255320 598785073 784929117 550462694 -82935538 615013559 -523024351 871406931 902488753 786433498 -723236506 -45887452 -400582879 -996407050 211655662 112265335 -762864284 -945017569 48092606 960858483 -268274064…
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: 2552 1609 821692820 226251345 432126293 603661301 385449679 -394545273 -328666185 -67759033 671733014 -391802043 -588927341 49572423 -117422530 752133680 -532838767 557844053 247563416 -535020405 -931794525 874780880 -301682675 -304748815 348202837 -484215710 783283863 466210489 -562845970 -853186245 -650022880 -789325534 58628704 813656364 -650918177 696426654 991090164 -380554552 836428171 411801314 726534544 -319229162 441239370 -18920593 -160703755 -116454478 -872619101 499854764 424477126 5689821 939242197 112406192 -433153704 790131739 -605260747 705611764 221694728 177854699 232677722 276360881 438896892 -523993515 -729130586 -412820566 960808391 -197393398 -518775194 -124680992 101101011 -999743953 -889511020 53352011 104819196 48497289 776942551 -85555255 -197098139 303657031 2384…
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.
Hestia's Radiant Ledger - MEDIUM Coding Problem | CodeTikki