CT49198

Xara Counts the beacons

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

In the sulphur springs of Brimstone, Xara the bookkeeper keeps careful count of the beacons. file the annual report, every figure matters. 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: 1016 833 -380814008 448803212 -554190231 -66571210 -197046299 842426492 -161373193 308828518 223385139 -98136770 -287630000 647356325 -273762516 -21946657 -119240500 -326450620 176842738 -483324307 616620986 -770631653 213226072 -319605216 -716691225 -275478604 -752803123 -180342574 999334142 -759765530 652708045 -185027852 -623569332 -428169122 271555978 -205444919 -138030359 240655461 -414604871 898183415 -213739898 -990413487 519036131 -330605720 -58692302 262086478 415734604 -917349219 -50399032 525373721 395420737 390378214 941683137 -940603933 -380755378 376599137 870531159 -390208021 77794710 -466235275 -12884392 -55304860 722453179 -425560777 -961959309 -449243294 344280443 -800946567 963235613 564910695 -759394886 -585786442 140185123 -196948027 -845360992 261594170 -118684557 344…
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: 551 431 65616668 -117112036 375276668 502553153 -13276908 -710096281 -898860375 -716612493 834700700 445518372 82139364 -774119486 254445268 781964405 -19315518 857884365 -709378709 90169176 -554607081 253261957 744175882 -331705525 -683578450 -83325349 477962287 -91412553 -591287401 617889219 791946382 248531864 -44822034 36288780 631208974 -334471144 -425886794 465688674 -681250196 -254317834 -573592184 550899364 791780376 -300574841 666601216 -38532205 -880436900 505504123 -465939967 -527763182 -872187122 -619136954 -720678716 -982104039 -752413137 109496194 -665687810 375422935 -615799981 -651210410 -513741867 545728532 -10858360 285878183 977882189 59028161 41610027 909600143 -2743938 267549316 -349237171 -837164339 325498467 -410879215 529493218 295805836 -920466127 -647964418 587350…
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: 6 3 -320452695 -444809673 568394953 -356580527 -872216908 40611022
Output: -1 -1 -444809673 -356580527 -356580527 -320452695

Constraints:

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

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