CT47102

The beacons at Tranquil Basin

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

In the lotus ponds of Tranquil Basin, Aria the scribe keeps careful count of the beacons. Tally the donation drive, every figure matters. 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: 1564 1024 -524937686 -890648287 61385046 308237497 425158452 525426311 843923531 -312823700 -562123219 -44948976 -729684132 -735001291 515236029 -213816197 819473379 -72460843 640664204 279184734 -269363720 -235694848 -53879211 -461676911 982726664 -707654164 -431156581 -33844108 -892081429 -826413881 573328588 579702983 -937221337 -514432983 292394074 306591107 -508535835 461947580 923327181 325214262 573807692 -316335754 -890881378 747999915 405725250 -22329265 431200361 188261092 -644222685 514954674 -319628152 390981630 719390638 933817331 -63187663 579742613 -494853361 -997887483 -56334009 376699090 -232591002 -450249056 597564242 201262417 -98369697 -895507100 785437874 190754391 -519073325 -134243485 -987321446 985384155 -962012529 567492754 230682161 -74803580 -614168636 575199881 …
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: 1512 155 209726225 -84238533 -110767458 661329475 -404355591 -115277651 686754618 -999725422 -223738475 -40547496 567976305 253512721 103636227 -360874784 -139011885 -164789871 -686038561 -186911330 750232908 988635484 -964207924 -859558135 436108795 842707824 -729567692 -165261346 455806 -639597837 -863709308 168490122 -489908367 -87287261 402287273 222172761 -101733812 954639850 984432468 784056453 31831317 974643450 764145375 453039134 -559837120 -390772831 -227738199 761760493 -588075586 -686977451 725456659 896715599 -840225246 -122976248 325549393 323700939 903834866 -458779 348186597 465899761 -106627910 817807914 -134094747 165234222 648817477 835389018 587944413 856901460 585487528 -917307741 12989648 545224049 -404871575 907609068 -586505157 -758099584 -547146383 886529294 -18123…
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 -999725422 -991967507 -964207924 -960000343 -947029222 -917307741 -900836575 -892098644 -863709308 -859558135 -857624654 -847018599 -840225246 -814740134 -793305123 -764313885 -758099584 -757021719 -750887751 -729567692 -729567692 -723058927 -715896257 -709497827 -706115501 -690026603 -686977451 -686977451 -686038561 -652763448 -6462633…

Example 3:

Input: 377 349 -904901277 -837057814 349995494 938578955 172967061 -328836442 532935466 -43358947 269964003 -33483458 -72902377 -729644177 -534871708 803474034 -308549590 824878840 427015759 -728490372 -689629683 -415501793 -187703567 639964772 592121493 -773253549 -839589621 231158042 478560854 416801004 -125205429 903369543 -539936412 -326955320 -284169976 187949495 220434694 -458839123 -356710545 -406964583 -494488002 187977179 -753241914 348724286 677588250 -717479201 11149270 -905263459 222505191 -525406615 -398102761 -827658689 164267678 -464910256 572816314 -28392961 774732334 440993480 -604871547 -620826028 -340688807 818998831 -660688891 -615372724 442742373 -911856651 2792471 89903649 501563005 -841991818 -364783864 -842550652 -56142686 -763963847 -135391232 -810328765 -579962929 -83094…
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 beacons at Tranquil Basin - MEDIUM Coding Problem | CodeTikki