CT53666

Sable and the K-th So Far

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

The council of the quartz ridge of Glimmerfell pays by the answer, and Sable intends to earn it. First: the full register of beacons. 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: 1126 462 121842406 -330719036 999042046 943061167 865116054 30461877 968271506 -506216702 266044524 -248219343 -760128434 488983688 468997546 642816238 941761906 -30500962 516236921 -444076522 -294674991 -606210134 -288859043 262727958 507349040 948755682 -20103905 334446285 388941827 392820609 812698942 -873000658 13300834 -183573641 576089772 -997967150 280032675 -789379433 360297461 -942056484 339693033 58421059 -960648953 -597317514 -497827793 -100094998 -399992199 -981602531 940627608 737272714 613963038 -645101562 708228984 472424859 466831100 -231411002 459718096 -399099065 -139053539 -247036129 196054452 -582839229 929994350 -13514286 203043987 -139256147 -774983953 359733953 61280150 245535386 781248936 580124968 527582542 -546366481 280935739 776821258 -89307737 -189622340 -76044…
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: 2361 1892 -863128906 -603366249 -238372108 -467847817 768182146 -970059120 765110576 642896612 -358707307 -545510829 -940876971 604250986 -480253880 551039465 -766498118 -183448234 -556576589 -943662675 583546329 317394599 514260852 800582745 -774648182 -677510174 -947583700 -212692758 321294649 972980579 950278892 -747375065 -768257555 121985251 -601074097 -367972173 -644399754 -198918045 -108427666 799883160 -253680055 23165247 410847728 -804097469 618890202 -857017514 -112613858 858582366 152402197 379029893 517449293 -621824707 855888081 -476294413 321054246 -56874459 325175026 849616514 579432097 -926190072 -186701648 -52230620 -401824057 485342589 -816491793 -896775596 -86166056 -491367019 248446772 -743711494 -276753678 802113781 -673936793 102686066 -838176669 95818878 520350719 33…
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: 3230 1813 646795166 -217813150 -178487899 -676424977 157021372 477082646 -784010713 -962960941 -139248868 -619539578 -694796697 119541886 328204648 273981452 473481893 873253796 -894662896 -221314536 961466983 304602774 172697513 402542421 985496287 -257991682 873063100 913114358 527339152 294280371 264100228 -44569285 -603406240 -457142026 630253048 291261967 -882794798 317552875 250289310 975002923 -746927115 -670507672 -815694318 -92267995 226875452 324641276 -225886034 324021544 537848954 -511338776 -211999204 568436854 -793790471 -705737093 -342652735 -667531928 834964200 -103029244 -183386313 947034353 -894691940 -470041015 -383723968 665110423 800577969 914049135 -52151011 904823462 93962555 880350541 -697590153 -162623077 -209687492 -87048520 216114043 636886408 644690384 -79947551…
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.
Sable and the K-th So Far - MEDIUM Coding Problem | CodeTikki