CT53551

Hope Counts the ledgers

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Every season at the anvil district of Hammerfall, someone must certify the cargo before shipping. This year the task falls to Hope, armed only with the ledgers register. 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: 3588 17 -939983692 971663301 -835553971 18836413 -335648491 -782013332 -718292942 707541398 -847405202 -964767332 -168790626 571251008 44271000 550421992 -89314548 -380399867 -579828029 -264209788 366145668 394540087 166985824 -661046379 -408616990 822131996 -523416009 -831128241 20190460 -107215757 -143270845 240266472 849385278 -52154181 -440026249 -570781267 200455148 193602612 -4032638 850081676 -648396503 433504072 888707495 -580171583 -727657245 218558039 566069026 -469744247 -903996559 -163185051 330721836 -370707125 -612108284 -865337799 -114457702 936371121 -883776137 -137799815 105152324 -995320317 606334291 797813261 -435533889 916811672 99410301 617079579 260022918 149937659 220354409 -945891285 282427960 888408472 366312891 -908556188 -816886161 -166471131 -885383240 651947362…
Output: -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -964767332 -939983692 -847405202 -835553971 -782013332 -718292942 -661046379 -579828029 -523416009 -523416009 -408616990 -380399867 -335648491 -264209788 -168790626 -143270845 -143270845 -143270845 -107215757 -89314548 -52154181 -4032638 -4032638 18836413 20190460 20190460 20190460 44271000 166985824 166985824 166985824 166985824 193602612 193602612 193602612 193602612 193602612 200455148 200455148 200455148 200455148 200455148 218558039 240266472 240266472 330721836 330721836 366145668 366145668 366145668 366145668 366145668 366145668 394540087 394540087 394540087 394540087 394540087 394540087 433504072 550421992 550421992 550421992 550421992 550421992 550421992 566069026 566069026 566069026 566069026 566069026 566069026 566069026 571251008 …

Example 2:

Input: 2274 810 -856217455 395984580 184196299 -670382807 395328614 890072278 15266814 88757212 164785256 -145789503 -828383849 547062592 -481816170 766751398 318509825 623567818 -912012253 373244588 178133556 288437438 -55868209 -562039721 -396384705 658193419 128599615 -249809878 -963140818 -385232253 -244204463 921835395 380738684 368661603 -778588244 472583702 -887814854 776374449 -563405539 386136474 -285563997 971864377 61119159 204566000 847134378 -906495249 70883685 -95150601 220875635 398566624 149645717 -342732166 -984672705 319929953 358927928 -391793216 -695387710 -922522240 330882192 144963319 -280616965 -138460913 -755036283 448684744 367161096 138327643 -948027748 -630092607 -92659933 -864521850 795685188 419480379 -411405617 854095508 417163829 -340506982 200224779 -216803308 7845…
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: 3258 547 -28812603 961398285 361008891 660304993 -634125590 255243950 898731044 446265162 -68024145 406840951 -708314268 90414993 -763646475 584001019 838203893 264535699 -495554104 -884699825 -162283307 127407897 374686293 11162808 -206646285 -357930556 435924581 387131571 -276505933 843021924 789549328 -667291083 -377392248 -493452353 -538541256 323351745 535843313 379106770 936482797 658454141 265509832 585820359 246876365 441820091 -371913043 629927287 542934546 -141990594 -177665787 -43740707 -710787169 -59842237 905529738 -139253004 587245173 213318829 -200938266 261914265 -300767497 -418784603 952781589 994105084 -542134506 407870278 517784739 -821657740 755887735 760151445 26163487 -724646617 911392884 -539762428 866098101 416259257 -819674836 -192974840 -634229139 -195857907 42642…
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.
Hope Counts the ledgers - MEDIUM Coding Problem | CodeTikki