CT54951

Wasim's beacons K-th So Far

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

The tallyman Wasim has been asked to prove the quality of the harvest. On the desk lies a long table of beacons readings. 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: 1535 631 -747804284 -327513937 -338418335 -476642783 -836128396 -325391152 -794578493 506294749 -519710461 795661393 800806890 -683489643 280603701 -754395192 698961070 -577245412 280976043 -813104958 -857866895 927104513 134080161 650692381 -296423399 293951352 559549392 -676067498 -760375705 461960048 -599312977 -526370683 -995000262 -28716290 193968453 923887073 953977541 -7874415 -212698458 142272534 831470420 -317799637 688261377 439617894 -139956940 8893324 20625434 -193003440 632664187 -115178214 -424932785 720825345 -445103228 -877979028 399552209 -269873065 728651668 860640056 226969573 -856713470 -147537595 13377338 61534365 811080443 618681563 595528229 -73511237 -227791284 -753475962 859724913 -956020087 -951762348 -454180549 469065352 -594216543 266314129 -240448797 -128373359…
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: 2183 824 448903026 490143281 101184542 133769839 701980328 340421791 806322408 426647321 298998052 853961628 -977392432 -493038306 -318771602 -897689585 -556044859 -970587762 -552449067 -989849314 -104503263 -70321530 791388371 -273155656 117613243 -58928015 -741314153 -785279206 -823298512 -969652283 -272940073 774321840 -749135974 667554100 -841642025 -508390077 706122420 -713164483 405342928 -342214311 881611454 -511718368 -709797606 -809902017 914731216 -643633553 892399278 151804761 -768273827 -995141866 858278062 -268157953 860034775 -240467750 643177369 605256340 78979994 986757811 -682184202 -917129883 994053685 90608219 -607983326 606407473 783705016 -932910635 -791594416 -302488449 -552217259 -816919078 266965677 414944371 -389783585 -707058776 -839791828 -919165773 741899015 -99…
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: 811 488 -882678702 -891072604 -692795800 -471867475 926305088 -965716062 -846347808 403423848 -73736301 -626595476 -762121674 -184911985 -550303521 364000377 350016929 660417721 -866839584 420853874 -592749156 -185874561 -652502173 389303893 554811125 492411388 -532898381 -671548023 55244855 975508864 -849134973 292936303 993891242 938763528 191425482 -775228041 752217719 -790382596 728876529 -394145575 -688156247 180357933 419439028 887593865 48376148 -759767756 -165580845 -642504519 -8292004 -571079753 319464646 -135775612 -906510441 220753484 400059692 -721240792 260568540 118054019 -393457835 -335377641 906138120 680686870 -913246249 620521672 -387075996 837484590 168569769 -677293768 -515581351 -581259465 -818653838 176328390 577132228 426492398 810272473 -302901918 73181522 439041996…
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.