CT37150

The K-th So Far of Obsidian Shore

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

The council of the basalt cliffs of Obsidian Shore pays by the answer, and Chandler intends to earn it. First: the full register of ledgers. 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: 382 227 -294238838 203604372 -737604057 906664419 883026640 -424366175 -690979241 -148586918 -180588050 -133478407 -732599882 722450055 155300919 -656707991 -340736096 -624818505 -64881295 -558634413 -440116787 -728279258 735326088 -133088992 -500095962 -648284430 324255389 -249241047 822978170 468720818 846926852 860134747 -387341692 -268553982 -26933971 436391204 -659442844 -797277871 -522366397 877833250 -149621345 -862426060 -523836481 -250605579 -854362752 -159104370 923255535 -136195090 -864874940 -683729207 650020345 25815676 657837982 -14466117 -339215984 757558799 -632275694 542575328 -393733821 490133810 -482421486 -183104768 913846825 -307336424 20077816 582867862 -410567738 323520499 615739695 505989623 451788047 -828052468 -297372301 658856879 556805928 676972399 293897773 -45…
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 -998024871 -966973920 -964902616 -939175514 -937907439 -905905366 -900753402 -896926866 -892797174 -886785961 -886689224 -…

Example 2:

Input: 1637 963 434773281 -546558510 359002540 265881621 -507079309 -327842779 -549314852 564778716 47470017 -787578038 -572911600 437732943 962492971 698648889 -175991010 724646617 -957431268 -985746008 408169112 390983667 814773439 60930627 210000429 22173411 -320447763 507154662 27607231 -516669025 -866933158 432289425 -376465892 -140780867 806987248 366096468 -630147482 345402042 79981167 -32665417 384447373 -140138260 -214984092 -854715041 -448502146 159542959 338088271 -881790354 465626668 4479211 -895791242 -804500418 -679525064 398388820 -921522155 892996614 340427941 -629101945 -380493564 658792601 -727650845 735030515 133781403 -579884883 109532817 526456884 -559656085 -132168088 258462092 -589471880 -858154747 -320343640 -106292195 -222370039 403639884 -125952975 -901108718 403599949 6…
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: 264 108 387343848 792647556 568081503 -282207748 882325774 -320191729 -668524982 -398972056 121921621 -789335496 467112343 -745566477 -444600049 144707464 -93784010 -81434380 -82945630 345557629 991040979 557281464 -101327299 575009209 -376429760 -646559454 -729419976 994039982 916697448 -346814371 -327904550 -309903520 292889314 326904371 -307508811 -267428529 932030561 -886595801 -681589300 235422812 -466919462 97434416 66548963 -451690278 -789429568 -2749472 -10275619 -369648360 240757503 -775634993 -808371067 968071569 -164123027 68472311 -411285457 295678178 -621806474 -689963603 558122543 189444182 -429913911 -443882536 -359466280 872318172 -358632308 270849622 849203596 -482012436 -587011091 166947292 -880739716 -904920278 -109248170 -721282144 -267622863 -256288562 -928745176 10257…
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 -928745176 -904920278 -886595801 -880739716 -845559294 -808371067 -804816197 -797859498 -789429568 -789335496 -776202535 -776202535 -775634993 -745566477 -736778922 -736778922 -729419976 -721282144 -699215932 -699215932 -689963603 -681589300 -681589300 -668524982 -668524982 -668524982 -655349355 -646559454 -640233939 -621806474 -621371819 -608480110 -587011091 -547022862 -514177895 -514177895 -501728261 -491500416 -491500416 -491500416 -489367023 -482012436 -482012436 -46691…

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 Obsidian Shore - MEDIUM Coding Problem | CodeTikki