CT44091

Eklavya's K-th So Far Ledger

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Every season at the pearl fisheries of Nacre Bay, someone must price the new merchandise line. This year the task falls to Eklavya, armed only with the signals 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: 374 367 -622636744 -155377825 390516853 485128788 -231487799 821587780 -802712951 -68701843 -696044693 868744456 889531540 -729187441 -379778799 935049423 597351639 -509428772 198293323 332496131 -427508332 358583480 51709974 -107588805 130778588 376053915 -880918631 478676589 -495392476 -793668452 501640494 -796710276 497506476 -681960787 928311415 322620977 -277872238 -157082719 -215291996 -388806186 813970211 666538805 -55494253 -271073102 144781621 -875710425 -254488491 -443263033 -70633566 -788030438 -804033254 951671834 643676302 -417856556 -715991535 -381523416 826727019 -578183893 261221291 793498449 33340673 -416309318 61057347 -220319810 746699456 -412544881 59705871 -280600643 198184185 659613236 -657894698 441996098 -848008033 -747072673 -490336285 -841875321 667656730 78435994…
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: 1067 439 -767202624 -549051423 -625808437 57680828 -794552409 369797691 -670025832 219780354 -27666378 -814008783 670613773 -33781584 851319168 279497027 -350713985 33007330 -901310985 879370236 672459881 -466429118 -968397077 264781690 -709928190 656525039 926492263 -681363513 69352983 842236631 -405744285 159029330 -11682093 -769163157 -309146056 472034773 -83057454 411133665 367280651 -401911679 625761149 -211845155 971525324 198788400 16423967 78752261 36444169 150210232 56933753 -175085978 396228724 741180218 -619810305 633871507 522205910 786714413 843391904 -970287977 -36384605 715726906 -500509984 541005357 983361200 -787288855 553715860 -760273072 75216068 660246679 473759871 -983859656 -107485608 186749961 777983569 -722507242 115711403 -310639855 -547000868 -842906154 742656183 …
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: 1466 334 -40481303 319061173 -125345796 -1040896 80285060 -380970561 381256290 -609627209 -266160627 661701123 370298945 96935633 369217766 547297637 -311092701 -144346249 -283825298 799613108 -606776588 -779718862 -18392463 -503454571 779017950 -970644041 928641138 -573715461 119413128 -204888666 -231875838 -199423108 925126538 -553646523 -11204239 900366231 -497032071 564277025 798371073 240824508 -894801094 115000520 -857548478 988652593 101382050 -43427109 -393924263 -101977248 -469021061 -671186189 -405868292 -840609498 630481571 405968773 -707734676 -991156553 -915888901 969264637 85634362 -710359184 192995150 -583299915 722134645 -696647634 365267934 -136507490 478092388 348795255 69147741 -777988855 -611076002 153420175 -839507269 -759718366 722615427 -820000866 388816877 -20915509…
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.
Eklavya's K-th So Far Ledger - MEDIUM Coding Problem | CodeTikki