CT50039

The Sable K-th So Far

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

The clerk Wade has been asked to prepare the guildmaster's brief. 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: 969 882 642684847 -368655673 781021531 -756903301 -898819967 -44500024 -757294484 720814389 824996580 373513456 675301757 -978407030 880892678 -848534740 607508560 -164279287 389068010 -60218855 -357508326 -840446905 -37058723 -188713324 -801136951 -827022629 168592255 -119276254 969932447 -544745126 134921390 -869296704 -852587742 351239262 -756779365 -651593076 578100956 77338758 373533034 -979073941 -922261770 -505076020 874831953 848191682 -159306471 928650157 -837988400 -50499427 -22752165 -881596182 664524815 482047117 -961356154 184997574 42708119 37777398 -972727859 684742385 814000932 -733698816 543029309 -874936792 -988052675 -771945119 142279927 751814571 -916134272 493996740 618013150 -512530338 -263529449 469246768 86349955 472821544 -843643920 172936103 -828200608 57542654 73…
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: 529 428 -172367562 983679515 883103363 723515978 -147334571 -372823028 -265381603 -320305051 64676195 214054548 -718304193 181385571 920509638 -436252898 -603651024 -916944966 -556385430 -489516588 948247343 -303687090 -708570703 -64319140 -466217868 -702394635 -247250930 -365939094 -443345372 522915337 -287859078 -31152767 -892184765 -187613099 -261658946 181209168 62526667 -795553160 -421272652 993695531 674329044 -501998556 -435838638 -373630640 -71286426 845142764 449541498 -951928509 -108356992 -871766699 -169506198 -787723329 -262876953 -748801757 727159542 449047015 296393025 -682480522 299666668 -406701111 237356478 -735153803 845550449 189745510 836766248 -726177564 949756468 -192754468 550087399 -35184886 720220641 -793483765 -477788481 630826399 588761799 758421843 328699950 340…
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: 3967 2436 124049505 422234918 -504078924 332486192 318345473 512185808 -786057999 -267801876 -759101603 131457202 835448223 -338551176 46589742 920586083 650861344 265019857 57350526 -448174983 -873663538 -221082172 505153595 838035220 824039660 846603741 375754728 481748873 -551064273 66690523 -574228680 -997310443 -962676224 62614266 953484870 -636966834 -141761011 -870869650 845486759 419217483 195054896 651055350 494112504 399691195 -518186119 -461551035 -857573242 136521022 -97905671 -345513386 -845625498 -648773152 -275512050 -245587200 351392447 354133903 -421101830 951824011 -513313288 662882242 314195107 754633989 956685470 560833451 -7701019 -128359225 -203179684 407330724 -261022935 -1718086 -89166755 -832423477 669159208 -760700070 694984860 -431504804 464191625 97573825 -62243…
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.