CT40703

Zane's K-th So Far Ledger

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Every season at the shipyard of Keelwind, someone must prepare the guildmaster's brief. This year the task falls to Zane, armed only with the marks 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: 3224 2276 37649961 -942766303 -991464751 -564877240 -780692404 275054460 -375067450 -767261073 -748359086 562979928 -131566135 -694440296 995048844 -260992309 831061805 -696826247 821822979 157827601 -477130431 -966843915 -821565124 -954018552 604753014 -951434694 167751588 -690869959 -712684635 859400577 372485924 -155342788 487486247 692475318 -680710401 96166503 935593218 -669734571 113472547 -402624788 -155985849 -409657485 845662496 951205617 -59679964 619596568 467299452 -342367572 390850280 -924213632 -906889443 -400781015 341031613 593182983 194971765 406610278 -134216709 794098177 11219561 -256311940 -40915848 775076882 -358185296 210773419 -455413687 434799356 206808385 843041127 -462719778 -14720948 -565695038 -236072694 -397909238 92092353 -798041487 -810842727 -119579676 65563…
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: 868 371 -272530544 -427281643 -854293614 -440912503 33654934 -454225415 801595872 -861250013 -483240368 -414354859 667980724 529901098 580397661 -967657965 476866497 597298275 696055313 9829018 -846339849 -85104121 550188137 -702062291 935637018 910489680 374050486 -284601912 146199377 845110671 227462658 369628819 -250978716 -444551403 227017199 355563141 282218326 -922823051 773348658 -851008047 -527320057 744935200 -671070915 -8946681 -84671497 208035801 -452567729 -164889301 944372125 -436235486 -963742151 -706560237 152613459 402392109 772074787 -921346167 -172576455 -582883348 -263547677 -348459851 692088353 -627176241 -708591149 225388558 -373829661 -833724083 -120766604 -728313209 659850269 -50263959 449215457 -45712588 -37852195 278185871 766214029 687245936 361063062 503432353 -8…
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: 2093 1805 771495188 444829774 712227789 159881908 281811651 173102080 -7108658 922363136 -781107594 519910369 -209692393 722800973 -759909253 106270810 682233914 -751149323 93293420 -731602239 535397337 887405452 -384160030 29403434 929972819 -112692906 -122025410 238474010 929598211 603721594 914381052 289210675 548285056 300552107 -933403720 -114370416 -835660647 -218306038 -610721708 811315905 974318306 758764073 -228363224 -185169927 -365386253 -551431282 -886094507 -235060544 557118748 -832027644 69235974 236173816 454604759 37638690 926147247 236191304 611930543 -25457645 -421093523 347717285 42441213 777982110 -654203137 940249613 -877682574 -787279374 -947935274 -292889941 -946072971 664834375 -519896117 -403362952 -577184703 772438527 -944665608 -219751272 -4295119 171668054 -9574…
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.