CT40985

Forester's Indigo Ledger

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Forester runs the foundry at the fox den of Rustwood. Today the books show a list of beacons, and the numbers must be worked out before sundown. 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: 3231 35 -174393059 735101028 -329629614 -798403978 -842946480 88730430 -832372068 564796986 -206043963 20386326 214526400 -354276065 -865693970 371437832 107532 107005600 -538161998 -373024065 -986085408 643784988 377714378 -636930362 -291351001 516979057 479868057 966636363 692391396 400861164 -61811060 -222627589 -185129438 568705328 999287073 490653189 851630247 370803589 548234426 662048972 -205547340 -705448296 -896524102 864413035 369002762 -973848667 19489163 505125050 637428009 -834608362 500081830 896699508 425517511 314518941 -544114103 -357964441 544956162 -409245497 155148143 813124797 250545077 69227381 806306222 -172194151 -193634789 880372924 488815380 -218588320 -866076925 -858686291 -538129582 404807497 610653494 -739957102 -589171575 712565518 -524510249 -26779277 -629281…
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 -986085408 -865693970 -842946480 -832372068 -798403978 -705448296 -705448296 -636930362 -538161998 -538161998 -373024065 -354276065 -329629614 -329629614 -291351001 -222627589 -206043963 -205547340 -205547340 -205547340 -185129438 -185129438 -174393059 -61811060 107532 19489163 20386326 20386326 20386326 69227381 88730430 88730430 88730430 88730430 88730430 107005600 155148143 155148143 155148143 214526400 214526400 214526400 214526400 250545077 250545077 250545077 297802427 314518941 314518941 369002762 369002762 370803589 370803589 371437832 371437832 371437832 377714378 377714378 377714378 400861164 400861164 400861164 400861164 400861164 400861164 400861164 400861164 400861164 40086116…

Example 2:

Input: 2599 1188 969999631 -525570976 267759962 359098932 31664709 -41161351 56004560 732475939 -100458379 797077897 -298317251 -160892881 736549316 -644133890 549889616 -323231914 473965764 -627808177 636994675 -815715025 479840832 997353705 929682005 -511498187 -44116495 242784655 -48038593 193851411 377986667 -87523810 6495962 492912069 371284990 -731621873 519141118 -582218382 976194107 794773612 -868027853 159257018 920871488 -751323931 -741270983 -937964878 -223462439 -405967326 990172794 491014397 280650642 943577285 957094886 128588745 521603468 418794860 182776365 -962281043 433469899 53703490 -372000499 -955798265 707339506 -130497180 -490656035 -129459126 902805664 -279246582 -286132608 248633162 738693923 -547062357 126867462 -379432523 -848047969 526750539 -402038135 438785379 -86142…
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: 1831 1731 -353001281 -291022471 -742221982 -75899383 -223885344 471356931 978505499 -441361708 -881548035 -664328988 821288807 -944715186 -190424931 -224952247 25535212 -870071614 -204090888 955211553 802389218 108267590 168813624 546527025 -284949089 281401845 452501927 -127434153 -329219983 164215337 -960492227 -841787223 216199189 421911247 627248064 -462550686 271749209 -969636298 727378914 14898407 204722391 726136171 493940042 196409786 -283073166 212919116 -854067761 -79649141 81613494 775684293 -29733166 764811059 865230598 -601981096 -274377793 710964866 -456873505 491618032 -405629323 905114060 278478199 272885654 997838455 336408664 -182360944 387842309 -154949098 200893753 -391059112 -494443345 842815699 393928624 -796546318 590871671 -797701573 -224904525 -857815183 93083944 9…
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.