CT37546

Nils Counts the registers

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Every season at the zephyr cliffs of Galeholm, someone must secure the caravan contract. This year the task falls to Nils, armed only with the registers 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: 2176 1322 -640786648 201293725 -461256914 714382289 -576663596 -979261049 904348711 162100321 565282807 -951381764 -766143053 -716371295 909848855 -833123537 111356770 869959127 -486722721 -973700537 219351338 -897785942 -52255183 163990948 -314951588 -293754673 -714370420 142741428 -243220466 199809762 -486972054 775234184 209361713 -961349353 -840524409 631100225 -438920155 -7970576 337662527 164719174 859526626 414665793 -398633422 698266132 -813147304 -544692676 -717428179 -255900312 201442716 870546775 -988923462 562920197 -494439327 -97107737 429703226 -316989544 -461002159 188173160 -596480936 -577876161 920003675 -510852911 279905126 227892978 502218679 430028981 486119917 -602137886 833549278 681853014 562382338 375293693 50255666 944421557 -831817856 -32953754 907844550 -54993517…
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: 307 210 911435678 679754662 257296879 -211114107 702418467 -85829724 -120688183 -83263475 147596210 -238063031 117520600 438526564 -86129885 -913955701 -324212942 -680101391 987198250 -932795451 860625686 -623115860 569423391 -802376558 748477100 554184063 321708830 448734059 812886897 281224135 -868458157 -212242799 -447992669 484756186 -573161327 -945223427 79744908 61446479 175140602 2906920 211326036 347550544 608562113 163334610 -673667155 720402048 -672085864 180012864 -691288123 430433572 -939190889 741360138 699487122 -530219942 241027939 -32088248 570242256 -935657805 -573172349 -445732622 214399495 277347662 -588169409 -989837131 -601611215 761021725 -248197650 -787941086 795645148 59200287 456221475 -647068959 -366503962 554644544 -886666164 998871874 -871301430 -5993517 -648283…
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 -989837131 -964568951 -960931524 -948921033 -946433265 -945342064 -945223427 -939190889 -938579623 -935657805 -935123982 -932795451 -931964683 -913955701 -913279496 -9132794…

Example 3:

Input: 2336 1865 316665649 345945849 -215936775 573514710 -508098253 245026135 482662718 -404959834 -265076715 -351151122 299668636 279928285 830293068 890077092 718880597 -119457810 94166181 935325457 -106047989 966756227 -511318608 537747267 570601455 552272087 263465806 33372126 816080954 263330108 897079491 517011769 963415026 -552103784 -606271082 -686724362 95900184 350996966 -686237957 -260196080 248910156 662383195 426256208 971211443 73834298 -759610136 -613205223 610880619 239317114 76478937 -547599732 921654129 913146330 605212406 -231738431 446851471 -446461330 -23551761 724983573 487777265 -150407938 -217760756 974997018 -129083952 942155749 -645412092 858107155 126553228 -619875375 -69578739 -144730594 -409977093 978568121 -626598023 160803704 -414148065 348928344 -29793798 -4701133…
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.
Nils Counts the registers - MEDIUM Coding Problem | CodeTikki