CT50279

Petr's K-th So Far Ledger

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Caravans arrive at the salt flats of Palemere with crates of ledgers, and Petr the customs officer must account for every last one. 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: 102 43 -725481326 262951052 -232894940 -787045581 -927425977 681527990 538625632 -277704162 917137123 887804254 -115551945 760848643 -936360563 785107679 278061236 -352192348 -363703754 178772740 163851166 22385138 -631856507 -419546306 362080475 352090067 -442840998 675332551 969703981 755080418 -917950988 -836243032 -713207360 900974810 -715037638 -930748942 667253246 -554631402 -821779927 901886635 887403037 -129703943 -379057088 676076468 923917714 -411259068 912309159 -135543193 200788348 576330489 568909483 -91818974 632356979 850530028 -489406586 -158117992 -954153920 866201552 103482296 415672921 -587917254 -701707937 -438703114 184481248 900346716 -65346636 293657867 548210663 -403656802 -149717261 74636923 214057519 44600948 15021250 593621896 -584912597 -526691812 -292677370 438…
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 -936360563 -930748942 -927425977 -917950988 -836243032 -821779927 -787045581 -725481326 -715037638 -713207360 -631856507 -554631402 -554631402 -489406586 -442840998 -419546306 -419546306 -419546306 -419546306 -411259068 -379057088 -363703754 -352192348 -277704162 -277704162 -232894940 -158117992 -149717261 -135543193 -129703943 -115551945 -115551945 -115551945 -115551945 -91818974 -65346636 15021250 15021250 22385138 22385138 44600948 74636923 103482296 103482296 160594225 160594225 163851166 178772740 184481248 184481248 188828527 200788348 200788348 200788348 214057519 214057519 230192495 230192495 230192495 230192495

Example 2:

Input: 3084 1011 -74821279 -188589355 243636640 472501535 575139306 232133193 -279920229 -977302117 260226659 679381662 601902272 -513858497 383371675 492038011 -976601872 388780062 -894440433 -706923613 -275874329 776437725 -826274229 -664823408 -646129914 -508493566 -743744022 -350123176 62982954 -679353655 -663352649 -608134620 -865017873 -470487653 448857139 401480035 -454161751 315350079 -573149486 246923611 111302502 415041244 785922750 720270378 -719488309 862893326 -847373478 214849049 476151623 -642365370 -515335793 -223498504 -669661933 -356948173 -546983223 433552539 -619104011 507650834 -896735995 -275690432 -918936228 -975296559 663143577 -450843727 -316953496 489241861 -693808882 68157929 -769813986 -858656866 332617664 -279330917 508072053 -940558804 -85651874 -270369387 -354253812…
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: 1818 1149 -520800165 -58088611 -873890019 450268059 -630575877 -112846719 474728277 -726449106 562491591 -691447607 721128893 491488228 494512485 694600678 436070803 258301472 -791003095 11014573 -894678884 91713762 786848644 -126517017 573608560 851116122 852948955 182236917 368745407 355095304 -105938197 294201505 -842749076 163323155 170797034 899987890 -30937059 -444156692 446267305 -576261091 309373066 403045449 -965841797 363633047 -716661568 21935712 411600628 -443885045 -736696294 -215655901 -309765019 252173596 -718268462 546931925 405921285 287003926 -676690031 -52049829 675029220 590224863 -312577665 800475270 273053756 225746014 -871455030 -948670831 -763371242 -118190031 851588737 -535730868 631578096 982414092 280891363 -111563742 -781859753 523777578 103560034 -208318207 -48…
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.
Petr's K-th So Far Ledger - MEDIUM Coding Problem | CodeTikki