CT35110

The Polished K-th So Far

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Yusuf found an old ledger of marks in the tannery attic at the thorn maze of Bramblecourt. 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: 515 121 -920973740 -409672748 -846613267 -189985889 -825046664 -212895530 486433263 -188745729 -530500035 -516521781 -978294746 791669951 57845728 -433421890 38596882 -745570430 -434549744 770182593 -759152050 -719825492 -838710434 52172931 519123115 -1134088 18886863 683877159 -482466959 596775033 679050738 791070099 -760628802 -988597736 -160629182 -891853316 -500925592 -946340927 522250307 -514789098 526358097 38458206 -591839029 391918492 48213578 97388200 825183252 920223986 505627656 571301982 -200486076 -795940736 -543086267 612602013 933124608 -264880054 614684258 329256648 979000159 -980731659 99481103 348481697 620293795 -254522507 400621768 -586435413 37986978 324263709 159816966 -178984766 357458516 -903351694 404402543 -48362898 -550250687 286749643 -921903814 779780154 -42863…
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 -988597736 -980731659 -978294746 -946340927 -921903814 -920973740 -920973740 -920973740 -911525285 -903351694 -891853316 -846613267 -838710434 -825046664 -795940736 -760628802 -759152050 -753381709 -745570430 -744709272 -736354580 -719825492 -674322432 -649794834 -607634960 -591839029 -591839029 -586435413 -550250687 -550250687 -550250687 -543086267 -530500035 -517778957 -516521781 -514789098 -500925592 -490794058 -482466959 -482466959 …

Example 2:

Input: 3380 2195 -660748309 -390075088 -314316943 704543512 -101525953 -303162198 -48414960 310134920 -236504585 -368489510 142912273 838740532 523467248 100808498 388659646 -49151107 -762974679 -418015960 -584644930 -800776834 -908814955 -931538754 -485191969 -42529639 -151344993 609443321 793292591 650608887 71223353 -106153371 729976814 -553048019 507734212 -297267980 526613297 692797283 -611243138 -506017375 -355085809 68920132 -212158129 -289820241 551210673 -982135015 -351241606 362824786 384073886 -982947545 -648908221 374583110 -64191533 -601410570 326083111 527839564 -727412974 810932548 919032907 -830423785 -621078605 367663588 -295205217 422101231 949495213 -641129784 766517142 -319252336 74468588 -252470448 -472244232 -12484203 -563264949 555911330 911021027 -789565737 460995043 11907…
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: 2502 1164 -153248983 306152242 -446039826 -836289923 410649576 -718434653 -854808202 -111166962 -76995368 745332168 609291144 -268767316 41549163 234006072 -25692902 -144148893 -349337093 -520692942 -763087660 -563228417 -649198980 505482261 346761049 -765300854 764214041 -511272037 -528175535 -936813966 531171519 925838878 146485821 -479741162 -34724181 302129462 -396340546 -253663528 970237272 578460323 -3052027 -519266225 847521040 -611786957 -862237517 69889733 476987174 675154460 75052976 987830985 -536532562 633885364 -619234410 248509643 -113084035 -359703137 621748096 625750614 -648371150 -314089221 982662601 786801117 498320092 241528637 691670486 -959090505 381791107 -252189892 -654159238 810308574 140898228 953731099 852703130 -936920503 353464771 977585313 823939155 194404708 -…
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 Polished K-th So Far - MEDIUM Coding Problem | CodeTikki