CT38057

The K-th So Far of Keelwind

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Caravans arrive at the shipyard of Keelwind with crates of signals, and Pia the store warden 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: 1335 1127 -998351612 675515329 328282590 -248890713 -235277259 836903364 155415804 585474581 -181035470 913277830 584780641 -385215706 -496249091 12844613 98974459 -66614124 -687831284 -304866429 -533731980 35732431 249520706 920782071 -721028303 -748993529 -351063599 166450560 -93094428 -900142381 -651648031 201405611 -240542394 -440835711 659318445 -222409284 712075983 -418445796 225087628 393658708 -345976306 174834549 -62562365 -101733955 568953166 -392110257 -611160931 -99443294 -109129602 -738510413 52765008 598055272 957961734 -755070414 387885606 600920121 105379811 -379684688 -703375671 -783696317 -67016366 511250182 -339374691 -390619503 815527150 896263114 132762932 517410326 -620616668 -55195808 -68089528 983533947 252742810 471136340 -438643361 -964252922 -482693916 434806576 …
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: 3303 3055 354337572 459494127 -35388144 371879747 -710304822 -611683241 -8596166 -405330455 -751348196 138060932 30150095 -964938473 15247791 621915012 687194050 -649467949 -266063582 131594625 902899412 128357634 397890734 -217030494 -734280374 647593549 -693237865 -696932716 251729320 -366615243 129181312 -164713518 324235623 391477647 -277858692 827566565 -459478518 421852748 197107560 148766689 -31027488 875036350 -226062560 978434681 -559259330 49144704 473100022 -44045173 404787925 116148288 477483552 170489042 -638393548 62499587 -3435920 -224600547 327559497 -963416372 497408256 730047338 -108311108 629101624 -178322992 -823878280 -143513504 -14720937 -707567863 381465869 33829947 948175965 571611293 769739455 255431688 366944068 -134885236 20823058 -926570513 -711998216 478469442 …
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: 318 95 605486447 -761743666 -394139717 510667889 -119337120 450512705 847219575 -602523544 232261497 564237456 650888682 -276740115 -957325004 995194577 -504051196 154429690 -786853116 -821177623 301335420 -407737076 -242179391 -958202584 113726991 612821992 -441788684 522328704 -397094621 -874260309 903151918 -933950402 -780977828 -841740895 875048004 15776 686363990 -566298162 728199192 -117658774 -504407788 101582361 656581538 -284715284 390542496 -669070089 -129616228 -666733021 539564233 -387755224 -697290487 -538876273 29089415 -527860775 -629279911 -35227300 -869253311 707028398 -282115675 -491417642 618807313 -171157900 42088596 -549306457 835941284 651577761 108396245 -749697822 596344175 -89500748 80478903 165877234 -217790485 202457970 837808440 731664370 206379810 -424185160 -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 -980343364 -958202584 -957325004 -933950402 -929519070 -911579322 -876014468 -874260309 -869253311 -841740895 -831077041 -821177623 -786853116 -780977828 -772517318 -761743666 -761743666 -749697822 -749319816 -697290487 -669070089 -666733021 -666733021 -666733021 -629279911 -603222973 -602523544 -597992686 -571122189 -566298162 -549306457 -538876273 -530871506 -527860775 -511874892 -504407788 -504051196 -497802233 -497802233 -497802233 -495114834 -495013248 -491417642 -483778607 -441788684 -424185160 -418781733 -…

Constraints:

1 <= k <= n <= 4000; -10^9 <= a[i] <= 10^9.

Loading...
Test Cases:No test cases
No test cases available.