CT55171

The K-th So Far Beneath Saprun

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Warden inherited the ferry office at the maple sugarbush of Saprun 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: 3429 439 -468890746 318891562 503597939 368272201 446420730 -764631530 -58079385 380713904 -849831894 875168 350619935 97124186 267341163 -988121674 -122722569 168958042 111156340 494922499 -574111434 -969836972 -901134464 643701372 -952379492 -505989794 57831354 -735546049 351862645 -604846652 909914076 -715880712 335099113 -194767387 855485048 490152492 -969684094 -836008565 -490858671 995396155 -414239797 53170749 511518885 513977544 -562505985 -74895606 -126477440 -584161295 859970991 -764619497 -501392591 -770882020 -385535452 214652014 -710639719 -111523249 67590251 -782336074 825575517 853308332 519184529 686002191 297070569 201388738 671615897 -762185379 989838718 -722433617 -270039769 816559408 287421423 984209271 -705244694 -437343308 463406726 -510028108 -765900935 -689445975 21…
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: 3026 878 -553414116 804229812 -241026475 528606600 744895538 511440121 129790918 625696420 976971702 374290198 390780796 -432197892 579293605 -872286100 -576448814 -345052548 840858299 -353843949 389575287 79310941 -657274498 244805065 525511138 902672531 -172272094 -172265205 595720629 -531952876 -567584455 412124071 -897686253 953581850 329159212 -291825299 -440051372 496685955 206440262 6240610 105155762 49288098 -464761725 570264747 -709795841 -127738803 -608833040 -378225475 -541612647 -806092425 963120914 532307092 -172110296 332936385 41552473 -999302060 472806533 308038239 731200351 -538718229 579173889 -117309433 -457863791 -851425133 -11802348 888471195 -57005750 -761820218 -750451943 -58738556 401737471 914310297 413619933 46211048 -326514307 271725938 -676203922 296397647 51130…
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: 2322 1670 747315002 682438333 -941126733 63953074 966825157 166333498 396245943 -687050937 -29829538 -436634420 152276598 15625373 -631471598 -983651671 -312263793 -668652775 -660876730 759544175 -883893281 829648215 -823267205 -951245869 483086525 790554726 129868515 760917548 70938720 -257000418 993931609 -333011756 988507452 340427005 -687792790 -478372384 -608763973 155888372 -309921729 -758362018 -234283112 900918925 759974883 584771000 -475735730 630607360 -20842373 337115238 480886410 698577056 -329167629 624404695 777988792 367644786 -92418021 -208702932 -842026684 -634914841 286541014 140731336 -137916911 685413539 3601046 582202526 235983387 916314725 -843112482 110803427 505383303 156309053 128418049 -639282303 -336514301 170695604 899661427 -38173886 841544697 984597488 5788991…
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 Beneath Saprun - MEDIUM Coding Problem | CodeTikki