CT45206

Captain's Umber Ledger

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Captain inherited the brewery at the sulphur springs of Brimstone along with its curious bookkeeping system for registers. Time to make sense of it. 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: 1000 997 -818972539 396684886 542872615 603684137 823748782 -950697687 381016991 961802871 -269173836 864481240 -661996912 -836561534 50455193 220591555 259363925 741748509 -291957739 -340967908 397726520 -728943738 819556174 770902917 -61285058 597319409 -518508185 529905454 79954359 933888438 970838686 -532329181 282855564 -172392796 -73501617 660350397 -25216638 -182234599 313187136 118681381 688903929 -519625353 508096038 -730745659 -544492875 -76036004 -167393338 913420657 -449714132 -352123495 170354148 -764886400 -786309669 -729249508 -67880595 717495476 999994124 -525027547 573268497 -604595948 121299155 -276130038 -346720280 -840656566 263739002 -913069532 -10018610 257293495 858090110 -321047601 954494505 611568895 660960283 74426368 770730777 -230661269 -918444705 406365381 -398…
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: 488 199 553266467 542328787 776772632 -362346861 -894771219 736662493 798242235 484744465 -907407728 -721701678 -881960926 599159469 74920853 -316723033 -491571717 -586956748 859091098 -465309183 -579615558 -571593023 -672065488 65134879 791572410 681994504 -381762211 -893400211 -797888120 96564519 643734569 194361630 -926187850 972832758 -810777828 -51733323 -312199216 225357510 -255605722 -267154699 -131905515 -226425862 -728604651 309645750 227997229 146798167 959793193 929196463 -170884004 -971540691 -235928625 -829440179 786720626 -284310466 39938021 -264132205 -441142660 115312069 502976070 -525110503 -921745468 517610768 -894393704 412390373 -990471975 -405151659 -894044778 -365573881 -752979896 859659328 182097948 -976229954 -503482155 291690250 37900133 -82425720 -165931295 -30480…
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 -990471975 -976229954 -971540691 -954150242 -926187850 -921745468 -913951055 -910979781 -907407728 -896041626 -894771219 -894393704 -894044778 -893400211 -881960926 -864135833 -863367747 -840615001 -8406150…

Example 3:

Input: 1719 1549 -595610435 882548267 486112836 -332910922 958282727 730528628 -921105094 561082604 66766834 770817729 338832558 648439987 92711596 -789000077 -590497547 -50582769 -176446646 -135540189 -311111747 75240654 517278345 -121586596 179148993 489546821 -112730618 787564808 438197299 509359249 -308603510 -322573512 -757699305 -812214322 -656171697 122795491 992293752 376247985 -373177663 456902835 -142150874 426927474 367469693 177886834 -797632904 -203124058 -305948559 921204696 -507212279 -952162597 528084214 896460279 -943084326 577813757 -186963447 509793499 331531521 -163919181 881094787 -453529920 -595546963 -2529445 -216319327 -898029308 -790535477 947917697 -672091332 203378501 -305456768 14013093 31232524 246002412 -758778920 -652062285 -78893623 -486585244 -733985475 484181069 …
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.