CT51658

The K-th So Far at Cinderline

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

The scribe Envoy has been asked to restore an old family record. On the desk lies a long table of signals readings. 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: 1111 592 636754526 -175604977 709893212 -960921098 -777891797 60935 41032506 -737950515 887221288 378849908 967494198 773013170 584045990 -111405806 -341283211 -90709124 48336553 -506999764 994640296 759268028 -182233809 16736839 524410176 -42042930 -746082762 -102051948 538781706 -28393964 148362986 -436605605 541823462 -281747097 699129811 138613973 353289358 -8965916 870327045 474278134 478459016 611311530 476752970 -298496523 -186281046 -70321040 416596116 885962866 -815814890 -68552487 72166270 374887690 303138368 -451983437 556654745 432922187 439678053 282142786 -131804496 -151916105 -956904840 14062622 709822707 652104696 107500041 310403046 520122262 311666432 -451941359 261977575 466994459 287317518 -210643537 177296600 -581109900 -627130853 453470799 379823559 -969373326 4205692…
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: 3998 875 -591821191 543947396 556109057 -746350687 -487910235 60740976 921888093 201161845 -994369577 608641389 -49662721 -611259071 -797225302 -645838372 977079938 -169648471 -775210292 -889186521 277024379 -118236136 312268708 144743821 -31887844 -39631858 -371088434 -204515517 -482713958 -237556001 -551585494 -494775785 499727513 681073428 761771328 -686905014 -774708469 -625192189 -550272220 -474919182 265333627 227474034 174883464 -430441959 198485380 374221828 617681777 -448233877 909327495 -972089958 15539053 26702655 489118958 353657362 -995499287 -263030580 362929862 155592233 635740252 689335679 -592678922 -625045787 316238028 -285271787 -911430480 694540648 -395191840 -299954650 -940815572 574617305 698111731 386944256 919488001 -549759401 993292034 -234298252 898259768 53546726…
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: 3954 3682 567107251 709077805 756987280 -165418073 179897724 777621327 866830176 -937488616 -952716934 -733920188 -201623686 886846992 -576309189 -40986864 358949532 723844276 330080654 825154999 98104810 690209380 -512295224 -973600191 -383107586 935787432 -161316471 429921196 316939391 -61418221 -601375666 -28201933 413537869 -334698317 827261541 -533719631 416234368 -97652313 724348192 253929458 676961591 -923887747 390267951 -505025518 -569166090 546911934 701761885 402863678 311962127 100421788 -645704623 362267456 921714022 378587392 -708357046 -211896842 -196789705 444674475 48259336 722292515 84403673 -456494998 909391525 215795421 -816150744 -472394310 -416509511 460212701 -417386221 542374872 971848238 -854772747 862044526 -7593836 -711452131 238423892 -870328392 -391742934 93678…
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 at Cinderline - MEDIUM Coding Problem | CodeTikki