CT39962

Quin and the K-th So Far

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Quin found an old ledger of signals in the workshop attic at the mangrove channels of Rootwater. The margin notes pose a precise question. 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: 3240 2317 86742714 463242221 501672519 884095135 844892589 -626362262 488909330 998435497 755784521 -542643357 550913699 898165217 -886244605 936301245 917835473 716830167 -594361510 593282062 -935858299 921285285 -30302012 318311062 838726995 133917723 -524739488 -302991711 380259822 -757893785 110522960 929040419 613983744 835816404 -873960080 -702416198 574368183 -792837304 552737063 88883468 907859579 294854283 -212473168 226681553 -314790219 -444869795 -718351234 705708009 356701828 196885114 -616232460 51407707 -514931896 680385338 467962794 -715466372 -341991557 -62684016 487143266 749478429 -968836482 -409359323 862573801 211621123 768190303 770374799 145683550 -721031911 -79032276 -681287406 -331822847 890183467 256081682 469667006 699208709 -366907108 -634513429 244696267 -395162…
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: 3704 3234 499872910 599883117 260249593 364419527 -930872389 -815314388 -130682452 -41702505 739847842 -502530156 420500633 576375298 -622653963 274323944 -781563325 -588185172 893550086 981965671 -540045820 -147804112 504795102 -675146580 814355369 -808624211 -594806907 756668177 -137390408 616116751 274749307 706551576 375580551 609924421 -474625067 429521898 -258802650 95461524 -959503090 -171519277 754745284 645149818 -943949621 -961903313 380749220 -403307794 519419198 641399156 629651528 191699835 109167726 -4235241 602449848 205393817 290020176 294556543 895297902 697402542 944110989 -472038623 846414290 467009432 67048022 -562049460 -973788371 -578525772 -528549002 97697771 779963218 -813670240 -908058027 572899731 -138254167 -349920952 342298734 899905499 -350384274 442654517 6725…
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: 535 212 616897378 72422494 436909381 12453233 519432044 353818001 -726405077 -825962579 -872672518 887715431 -377794350 -781736320 -590141203 99567246 821013907 132094462 118624788 -263722983 -211557767 930739598 253006810 -978490369 -946713507 -219545963 953691410 -134681028 43503590 -794403737 -7447166 204168791 187111015 231805877 -314701787 -806016656 -469713994 -658423269 -155784061 30749559 -440477437 354621739 360209905 849940235 -649548217 892835032 905951793 308842096 584908087 -912693550 -552733712 869765437 563831432 -742180376 -684267690 741554715 -88744849 574861097 288005188 -494544082 -365137765 -388250812 451137416 452706239 -509370075 389249384 -665378390 856900185 -225890300 -822939933 244328736 380211165 -349247599 889465361 -571185282 675528945 666205086 -939860686 7897…
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 -985262693 -978490369 -971809179 -967101747 -946713507 -946019104 -939860686 -912693550 -897005366 -891513691 -882392495 -879631086 -872672518 -865358048 -861953151 -8…

Constraints:

1 <= k <= n <= 4000; -10^9 <= a[i] <= 10^9.

Loading...
Test Cases:No test cases
No test cases available.