CT46288

Potter's Crystal beacons

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

It is audit day at the mountain city of Highreach. Potter spreads the beacons records across the table and picks up a sharp pencil. 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: 611 317 951935714 603410273 845937577 332364455 -193003171 -474079179 342470855 -560719690 -188659067 -278482763 -597472311 -672058740 -972453149 757541564 935225142 -698553132 344411039 -975892739 418100780 -681499280 986366840 194863740 216146855 -732574056 -249478892 553373991 -146725963 957124664 -213854699 907371514 369571992 -595153020 103350709 139541818 -463578025 -726106665 -107894378 -852685925 768463954 667897648 561594609 -428551129 803187476 -925614164 -773070681 103376122 112583254 334511770 -304858803 -359467731 465635972 433517096 -11920941 -972921250 101495906 366439301 -684906244 -964550267 -476115042 -924503769 106901249 966002498 230662699 -615542299 895256672 -931624869 990813681 573454250 708937918 -547670704 -556527821 856646017 979247430 -949440562 -249574914 -54787…
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: 3504 1640 877372565 -763946825 -427168774 103839958 -42782956 709629310 246462466 -368392323 435898605 -134286621 -572103983 453420787 -980036606 108778564 466661218 998927431 155908124 -199712791 -300416271 -734890299 912282151 -257989553 743351682 603043968 394835633 345903655 -277668849 -702871521 345461310 244227789 19727215 -314915588 -489316045 -312100184 -908269990 -741894110 605146208 -657207988 -991968834 766258237 804100521 730763900 426160921 445557149 -168321094 846753862 -28163030 -46133107 602833531 196194636 324462498 120394775 -484788876 374806650 -25192211 -340839592 -310257527 -881846920 -692750911 -891956358 340002716 847143265 -187868414 110816454 -177463917 75868995 343746116 -815305627 113170971 540702100 944554059 -787367807 -353541329 -347605202 -570953939 -79910197…
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: 2088 1928 486734954 252266086 960414866 -96429570 -244884420 174321565 508456348 37239405 684654965 -199387691 43048624 -743983140 690845539 -182046972 -283169409 -236994296 -615335218 -312290561 -894068038 -571663567 -403634437 182690540 236097016 -458400318 -160310777 -494627324 922978889 840596152 -680042359 560527954 734817240 -699874882 -364136915 -643377730 -849317177 -691752101 368693163 436611636 -267419453 377793910 929530819 -210382620 -395939477 -768028573 -120047813 208804130 945306546 425418793 -468839870 -332860895 -444371804 -937566903 -108978620 -560023634 430761849 -39893670 421849422 -355956036 -888073505 196706203 313961243 888895110 759104511 -523144301 -350376298 26851520 -454051404 11268600 -956063170 -216687372 -761788291 747983767 220281235 -980091757 -704235980 -73…
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.
Potter's Crystal beacons - MEDIUM Coding Problem | CodeTikki