CT54452

The K-th So Far at Screech Point

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Before the gates of the gull cliffs of Screech Point close for winter, Sara must finish the ledgers ledger - one figure at a time. 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: 1655 1401 804492446 397466046 731490249 175175201 -28257070 -835978538 -528076146 776764793 252670276 966181127 92639212 -121079467 -762102332 828246690 -203863319 -441416738 -910441759 -801596634 674618220 42932032 417208656 382961496 355730100 811457596 73543678 -931341981 779105707 395478061 -604612488 -22927895 784214276 -20252566 -581999418 46721331 585490870 246992232 -179010360 -895229784 469106839 85963322 -303840587 -100602238 -558633354 925892751 408296374 426271821 620980645 -615684265 -474037977 85893147 466867273 827672080 962656449 704941708 -782149157 -252968013 -873446308 307511896 928772541 -824970658 810319866 -59120791 754046646 256649074 -489117556 -770390238 276978680 -86882701 99994082 -60021597 -211436042 -80946216 -248086899 -139807187 -550212978 39165603 -592905624…
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: 29 29 911672247 -772464159 -821557523 -753903668 -626027187 73491996 189667706 850370652 -366362312 -230633846 -480061518 80199994 458599116 -477789165 565031874 937426526 729614899 128586273 -744956418 -895386097 -405138299 117895057 319145743 75458939 268294764 328728679 -240427292 -831151545 235100010
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 -895386097

Example 3:

Input: 1266 761 -570593473 -89831404 -74613242 132280339 -305669980 635792955 594529853 -141701143 -415814970 82488294 -205111345 341016215 734844273 -12326701 -132286518 -516227093 -605298540 844417470 -811630953 437458631 -163782623 673707278 302532817 209677043 -315669072 448490857 -510900595 96491924 163368507 -265171094 64678088 493071077 247539787 924390803 -37716057 699311516 522004039 -474324123 -838018546 -256590396 986854786 638242267 -577011649 520187215 -722925689 -392521659 -148968702 -257786319 -931642049 304734435 757498058 977912828 -286656261 -890571095 -774846239 529178957 212031941 606234844 -368636247 -180211523 488332146 951238982 -687960428 316921385 -101034486 280968298 -527490620 -39866088 -463028152 172277157 224297667 -993591212 628442522 -321142779 226262298 -39661699 4…
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.