CT47660

Corwin's Ledger of signals

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

At the lantern reef of Glowtide, Corwin records each signals 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: 3787 917 -739887917 555664298 -332621409 -676604586 255992866 -988683388 -302035932 29813703 -105864637 -990190976 800060090 739044932 -206856569 996114022 -764500775 423356091 712568295 -583715448 170193890 540971791 -278829405 -690124563 166942915 -938132256 -559518411 -472048370 561268865 -578281631 607299035 -568354226 -186499613 754049140 974780216 398761324 340442329 599852827 -150414273 -597776192 -833339170 5414059 259652082 -812358597 304059991 -516472514 335801192 409693866 255036269 -500973077 960158358 700362816 495999714 -595335127 595312603 321291477 692436445 657331196 -45146197 -207201022 153632900 779094333 444251971 179724306 -845177042 796657313 -209628530 -55871896 215934798 -515651263 433905670 66136346 -504151230 498705957 738173693 460711866 -732397220 -683174602 235…
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: 151 17 357000853 747872410 266468792 -265568945 -35913306 176998839 -305557883 106684664 -945670422 -915667777 -456387364 874010437 261127107 -760034048 -513792218 880707680 8085091 607788588 -413877028 680201579 168298752 936264146 -223506505 941060181 877790912 -744419808 152853669 -545330121 203113857 417929132 -932118361 61240140 -126216492 27405999 229161163 611497662 -541861630 161984094 233945038 -738663248 -475754724 432340545 874730312 -82063200 683752931 -464629915 516740331 -262998568 -351759743 286150826 -633262156 -570378108 817678503 484990532 -220118554 -662438252 908368359 -973758786 140820026 604285137 -596963407 -831580731 -575722751 -828240240 -360029419 395210970 -339691657 219532427 420004061 335144468 423501178 320367802 -255322144 265129234 546549246 -6373134 6995515…
Output: -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -945670422 -915667777 -760034048 -513792218 -456387364 -413877028 -305557883 -265568945 -223506505 -223506505 -35913306 -35913306 8085091 106684664 106684664 106684664 106684664 106684664 152853669 168298752 168298752 168298752 176998839 176998839 176998839 203113857 229161163 229161163 233945038 233945038 261127107 261127107 261127107 266468792 266468792 266468792 286150826 357000853 357000853 357000853 417929132 417929132 417929132 432340545 432340545 432340545 432340545 432340545 432340545 432340545 432340545 432340545 432340545 432340545 432340545 432340545 432340545 432340545 484990532 484990532 516740331 516740331 516740331 516740331 516740331 516740331 516740331 516740331 516740331 516740331 516740331 516740331 546549246 546549246 5465…

Example 3:

Input: 2821 2434 -40558942 -329248436 -945048291 -151931418 -838974361 -118929715 110443563 236558371 230420341 -991845026 33779416 -600184392 -765881105 46995078 307208251 493299658 -792051024 625074975 -236683361 319857961 858961255 145095274 -257686716 706350751 659225285 826080495 810154100 508871910 -558104194 435279312 454078164 19138626 -484952237 -788475442 -845516900 551263471 -272335326 -385588419 134195569 903791553 271124869 141350327 91333175 140664916 -201970387 28295682 -122480036 919171065 -861342098 274262070 908202185 189737603 28471634 449058263 -542525763 721933808 -318599363 520037274 -577135203 184681447 -735894739 756298839 -568338969 -707694872 127443736 247332334 245620589 -653432521 763427619 636583565 -711088532 358202356 213933394 916574665 32669912 140430793 501888146…
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.