CT51672

Chaplain's beacons Reckoning

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Caravans arrive at the canyon post of Redrock with crates of beacons, and Chaplain the dispatch writer 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: 231 104 -292095252 -550866641 917678696 978847257 645533284 -920109691 167791671 -908164546 -988937431 -902353313 715102358 -189955157 -426508387 -587029276 985905478 535292126 -770911337 -748701054 -921821716 -585478851 765962549 -301109953 193604757 432500315 -176800183 -923719024 907631370 270510054 -8343003 -770061063 -974354101 -689869371 817294137 210717969 450591574 -184973570 -959791296 772579277 850260113 671461996 876063567 43481493 -780528846 -928792109 807323377 -381486002 -382773612 950131519 260094490 564636302 20651969 -657409555 -242727530 718100392 797555630 -145021274 120510265 320528154 714867850 257363107 630828428 371689215 389326445 151212925 959149043 964063390 -608415385 935107817 -106302452 793991383 -977928046 465140411 -184411208 529100239 -7350871 -39123919 -512…
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 -988937431 -977928046 -974354101 -968527559 -959791296 -928792109 -923719024 -921821716 -920109691 -908164546 -902353313 -864481648 -780528846 -770911337 -770061063 -748701054 -711934820 -689869371 -689869371 -663457243 -657409555 -611982796 -608415385 -607660171 -595314924 -594801862 -587029276 -585478851 -571381992 -571381992 -571381992 -550866641 -512539422 -510104814 -510104814 -510104814 -426508387 -411597350 -382773612 -381486002 -381486002 -343992850 -329784218 -325080993 -317784…

Example 2:

Input: 3105 2151 -129489602 919792687 426137530 -373616253 796551182 427569476 -684067201 604946122 -927359587 -908064222 267300802 -461362686 749327488 -541905251 -286129683 837346885 -778577431 416037181 570638911 169594662 -491152988 -558952849 -437225097 -60994230 -825191577 382979053 -712804753 -31422132 896786505 789074785 -113114321 644131751 631894526 -776823589 776032189 732387599 -537442421 -367102201 -876115656 625694137 -161265835 -626390332 326121082 -908202291 -5079540 214977281 437186627 -9764259 -457473396 -714544880 492393117 -905530935 977334601 -393923454 861661952 659869812 549500093 -883627007 -211052813 156812281 776975327 -715490898 849905477 284976097 730809318 966049659 -875048199 -673913909 428249413 -988686240 701017592 386130594 815520045 -921110984 -697454136 37469284…
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: 2769 844 366587597 -29882343 -69137401 -876128259 -191595416 695731868 -347780459 -54647784 234836104 -967689375 -464953639 -286708051 -274935785 -688965157 -760154325 14790652 846164144 1241976 -585008953 -341242210 707112173 -188140467 568127822 -379701270 361312415 588962520 -814089291 -703797849 181330668 -180196095 693286337 446463521 847208229 -56088031 -443590349 -997842348 3031314 52475919 -525717093 -513570512 78903774 -39577049 822131426 -699388576 -539842940 790895932 -629626854 -529026170 464425068 242537461 530197781 768375004 449486537 -180507000 -436496125 -796423396 -478399253 -815431888 792264205 -407806547 -329518667 642697014 -317147720 117013745 293196273 -4369478 -783389086 679822654 430684346 273974318 214323719 -966976194 119273886 -790152817 756508060 831611460 6507…
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.