CT44326

Gautam's Caramel ledgers

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

The council of the northern keep of Frostgate pays by the answer, and Gautam 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: 374 182 622414646 31942713 -481366535 -110492357 256726924 529004926 -775238711 643882740 704564982 719547485 48455665 288892331 140118606 -277321138 585670443 -381957147 -399914842 -137097159 -570077300 -203449048 -167971902 620335084 615007082 185976696 623818429 468157247 583217569 640889860 -79104404 173923899 -465230470 -150931482 -330335923 836506207 -245822003 685938633 321570287 -741726224 -193636576 -590616431 209830606 16174500 -18321658 795331376 -121243021 -485851978 678042428 -492425703 904456417 263622697 154458156 -426308476 -355322436 258863937 934011887 348970154 855165053 -445969134 937115577 -914121762 184492317 276103939 -970024309 511543860 -953472137 -350591445 -79579943 588011935 65594604 -140380597 634566015 -550024286 -103499179 172925808 546665134 376347487 659715…
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 -989468714 -979185674 -976866387 -970024309 -953472137 -924361464 -914121762 -890326775 -884831025 -872769127 -860658770 -851639132 -842167082 -832577546 -832577546 -821814434 -821331330 -815738034 -806380926 -805489806 -790682868 -790682868 -775238711 -741…

Example 2:

Input: 3863 2003 109902603 743435026 -913515872 -201411418 982582921 -411005425 944574895 281539467 -644990814 571484999 312512068 -805168879 78753660 -927365613 410029616 -832769161 299532885 -650025132 -716292693 920169451 -615639493 295819595 919322783 -954886097 -359693439 846355869 -507548828 559286809 -486293874 443705702 388369670 -887021964 407839958 -186391199 577149729 173650210 182585467 438225610 607959075 221151969 -880448695 -901071998 -563509866 370448116 772005190 -760306591 -20773282 112928724 -756152888 -776749957 416248692 -612956357 -472012336 249183240 -895047716 -511276584 618007835 -39299179 887467504 396877346 299211019 840183785 -910723200 -325514868 715610178 -511213003 -128299571 -212979526 205913703 -872524386 538649312 373300319 -672228213 819529036 -700525288 7377473…
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: 2110 1107 -365023416 -781150136 -530318331 -906835770 244254973 54505020 752045344 332995797 -531283112 -68447693 161874240 -2412893 247966294 -708972348 -403468412 -725033086 -196905394 354929086 238724189 -821351787 -76748031 318346776 -89547649 139814649 -771021665 -821038284 459387766 -891094736 -488448673 290451535 227309079 -858498020 -510797218 768855270 553091822 688996689 231963234 -731791762 -81742505 -163269614 573756115 -627415930 -506651892 415453844 -813716692 -815109716 499313595 -804619704 109693327 -530336960 220018809 -289453701 693139611 -724421923 779998280 301419928 -421227394 596486691 12939889 725158574 339466709 -391998948 -997261043 313544693 861790522 -180818715 901637320 404208380 -21142884 -675662219 59068861 -884446245 862480103 830394084 -230334569 -979318436 …
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.
Gautam's Caramel ledgers - MEDIUM Coding Problem | CodeTikki