CT50510

The K-th So Far of the Timeworn ledgers

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Devi inherited the workshop at the lakeside town of Mirrormere along with its curious bookkeeping system for ledgers. 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: 3488 2633 439377700 -664059449 93783110 832457541 -487503595 54130181 -233188875 -645071 -77796826 -563308157 913067713 994779038 843505968 105767197 6096066 -800588268 392797829 592827059 640749629 -575170019 -927463210 271185179 919350206 -630167777 -595200571 940190050 -35400161 18583045 -840067286 579709596 965722899 -13357797 -537391029 617107693 -688496876 -794959848 -822261316 94307753 846416462 -400249808 837444321 604010487 -499623524 981674012 305202313 291537187 -469819868 -366314796 54059430 -968154291 -890736776 -408025364 363661568 -447004064 651295851 -105636449 -278374610 -418049339 735111344 169735569 -274069746 347357824 852632589 -234857529 587516281 -639029167 -899311488 -145799551 376215387 -646348012 -526988692 -668374079 418956221 -724000012 -724179191 888221112 1263…
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: 3338 2029 -522671431 -649410636 498150553 117605854 714155250 446828387 589198842 -245886953 861153793 315582357 -545138990 -683658202 -463572635 -913639145 -430454675 474838506 -812571966 840017386 -345101361 -238362409 -406875272 547904484 975916539 668333770 -610956915 -588817022 -576182502 110955886 496675412 721163413 22676953 546417036 -542241858 -543614371 349796134 -863607780 144813098 -148702438 282104074 617711151 799124301 -806654124 488220820 -698127775 946415298 539348829 -132166362 -471888632 561421963 39472218 447493417 -249597402 875845768 -663579769 -296025098 -484181178 -595055350 -470938902 981958325 -313685579 -646921102 -286051300 -925700274 -609701984 -672757024 -517329874 -521612269 39366620 972269077 -763703065 -952900575 -273590245 966176257 -79801413 105790715 -94…
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: 3627 577 -366810596 -547672140 -288428490 -736600366 567679713 -828849533 -614342663 -535405194 525934995 264961821 -808511286 209477751 -522529143 -912636346 368103250 603744947 794053615 581631283 -549286284 298445407 990702009 861551692 794511856 36969691 979537977 -553682929 167106009 -274171553 -326304870 -716644030 596092943 -116739993 -246576517 111715668 -217720708 -991190734 852577457 166265321 433910957 -510704574 738607338 -145112185 -230499627 -977679871 606227526 -343497254 401562532 -3361010 -305712303 463416842 155000440 71552409 730585716 -89656168 358016219 261496062 713574259 -886274504 681463597 -777532949 848232545 -970989100 604112080 -408549188 984836305 -426110351 93573878 390151474 498717371 288257769 -147457043 -742411949 450576404 296259106 692474010 -131268314 39…
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.
The K-th So Far of the Timeworn ledgers - MEDIUM Coding Problem | CodeTikki