CT40427

The K-th So Far of Chessfield

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Legend says the vault under the rook towers of Chessfield opens only for a perfect tally of beacons. Harper means to find out. 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: 2320 1168 -303362221 -846583828 56450158 112050207 70202663 356038676 -262658717 -176795544 320016772 532873065 -441762989 -67694026 -962510437 -495934886 -138356463 675751220 -978832675 547775425 -901488810 -82736652 50518099 86687268 -904326358 -865667220 613458339 855126477 312825368 -636360228 -650452894 -944964004 5560573 880839133 -448521249 551775314 -99704935 -748682796 126505067 745593620 589750826 123592533 423482157 -755789198 -65809493 -770942745 -331604102 -73699304 306577392 -488222642 -256644460 -826064 -317846957 752201857 -865201069 -903773829 -121155681 -487625782 -453800231 -86428828 -842122048 -728278428 -703077064 -201136345 -497383539 -282734146 -474628738 375112546 -790686350 -17707068 628904691 797731055 301601163 582748756 465380459 -49343175 -925394491 -757455346 …
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: 3718 72 93672868 -814646409 -534266545 -518787457 -170603788 626474574 -555796065 -185057610 595449246 247248705 150651176 -185926082 512400903 779702332 -677265337 -403068136 -778321580 -926379715 395791886 652925955 -450246178 -185605138 -528675015 -517693070 810523801 -965005960 -991036716 973355974 -94696430 185796674 93640396 984232578 775528051 702603488 539849382 467530054 937830734 493110059 -299762533 -145126757 520967393 417768439 -974593044 -540952612 60817999 21227050 -145987273 -143230054 983119398 -710893310 -111211472 -383425732 133097492 324015984 950465490 730244250 636814142 -839221425 -986661888 -838326115 -530106984 839627042 796755222 917155727 -697107893 -521610369 758660940 681828651 -422204138 -154899760 879154009 15138422 -865319937 872126078 75649057 288269854 -54…
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 -991036716 -986661888 -974593044 -965005960 -926379715 -865319937 -839221425 -838326115 -814646409 -778321580 -710893310 -710893310 -697107893 -677265337 -555796065 -543205694 -540952612 -540952612 -534266545 -530106984 -530106984 -528675015 -528675015 -527409909 -521610369 -521610369 -518787457 -518787457 -517693070 -517693070 -450246178 -422204138 -403068136 -383425732 -299762533 -297230933 -297230933 -185926082 -185605138 -185057610 -170603788 -170603788 -170603788 -170603788 -154899760 -145987273 -145126757 -145126757 -145126757 -143230054 -111211472 -111211472 -94696430 -9469…

Example 3:

Input: 551 474 -587380384 -401001197 677155044 232048330 500074364 -826657406 -227875547 -425976503 535868293 731582855 719029710 214858212 646093351 706071825 98375289 -244067634 609059841 713074742 586748954 594569698 -537819615 330580966 153841097 -561351488 975817184 119529646 673585491 964856340 -743656013 750329533 -235371427 -716016941 -370741762 675875987 -735645700 -734597082 -617965986 -499209299 -290611968 -722911027 -521601349 -224863865 983059495 503239825 137080529 373969038 -321558618 -184132586 528422703 812768331 -750241359 987565026 479338978 646070499 -919624066 -891747348 624350334 -634858886 -188578020 -765003300 881300370 -85353172 -532149559 267432604 412876408 382091820 -616009971 840381662 546536304 -30537603 219800862 -820982399 -753751805 -962238241 70559735 539342865 -…
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.
The K-th So Far of Chessfield - MEDIUM Coding Problem | CodeTikki