CT50692

Mason and the K-th So Far

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

The council of the sulphur springs of Brimstone pays by the answer, and Mason 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: 2541 640 -989209488 -867722113 558674317 864286870 -727927230 212069252 -983495319 -215364053 -627730081 -690805967 -768942198 144941819 801810183 610996446 -743634243 618439554 793189393 699498595 -958603379 711475841 643677782 715099228 -561722349 33959951 36924928 -908503492 -361686247 484379531 589856111 555833804 50630019 -353229258 324338234 188540304 -50807681 402154771 -672229915 -273570538 -113224115 783757967 -32804465 -509123049 240443370 934120704 -257129573 465563802 713648204 -626625721 155955815 56190827 -228183386 992310143 -913074771 -186571141 624258237 -353139998 -49616622 -942136418 -421286191 -494091039 514123330 183155614 612122216 839681089 948137862 203053308 101543741 158248208 -574022940 -367848104 -275623105 -277995179 -574904705 553466276 569447742 734037519 -70…
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: 95 5 -524657139 720533454 -313015297 885664264 358154014 -589981731 -549462575 31846062 776012099 -33243694 420751621 -155253793 -800150872 -504082678 993929721 -200589332 290787971 -250628692 -278733991 -441710577 580173881 -648599666 487343372 -45822536 -509146015 394561876 -25977768 -983099673 -595561936 467696977 856913795 -536809655 -214776122 -284460259 509613819 -116223935 365969684 -518530150 952276410 -1228083 -247329518 -490394133 104709626 -174738588 -493591192 -631063663 -600081210 144182352 312111067 -568452425 139619208 -33737679 -75762383 -632021947 -166724316 607740029 848216738 -651440875 -885670024 397354428 -701975859 659251232 -677031440 -698517243 -120863080 -282155780 679833927 928158079 -229765461 -776365819 -642527537 126935399 -525558901 -729974515 -521224429 56758…
Output: -1 -1 -1 -1 -524657139 -524657139 -524657139 -313015297 31846062 31846062 358154014 358154014 358154014 358154014 420751621 420751621 420751621 420751621 420751621 420751621 580173881 580173881 580173881 580173881 580173881 580173881 580173881 580173881 580173881 580173881 720533454 720533454 720533454 720533454 720533454 720533454 720533454 720533454 776012099 776012099 776012099 776012099 776012099 776012099 776012099 776012099 776012099 776012099 776012099 776012099 776012099 776012099 776012099 776012099 776012099 776012099 848216738 848216738 848216738 848216738 848216738 848216738 848216738 848216738 848216738 848216738 848216738 856913795 856913795 856913795 856913795 856913795 856913795 856913795 856913795 856913795 856913795 856913795 856913795 856913795 856913795 856913795 856913…

Example 3:

Input: 957 388 629948527 -694060633 905795481 110942817 280271189 928374197 233402651 559727389 952800723 -738379261 989285725 576482637 -73558406 -150919238 -406385176 -557806035 -369091613 -167356632 141106619 -531652282 -739884062 76200037 -126157370 -990590624 -187920811 -505636122 965417939 -111532326 -396870927 65996898 -777166418 -430636508 338006259 286761199 -127921646 -470769240 622932540 -313464749 -522637378 851301921 -337035418 639198119 -714363092 533160407 940552801 -626950960 453457051 38020106 -345152302 968548229 884010066 -128188108 511031305 -605658330 -370150207 -455674519 324229579 -74415621 -802669569 -198980122 -489021273 -684563138 393303288 -32381438 -837520988 261284636 606755302 244047738 -416273042 943877049 105302932 -228383256 924955458 839790636 -221977055 -8402792…
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.
Mason and the K-th So Far - MEDIUM Coding Problem | CodeTikki