CT35959

Last marks of Opal

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Morning light hits the cork grove of Barkhaven as Opal unrolls the day's manifest of marks. The tally will decide the next shipment. 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: 424 235 989531994 908845296 -45338337 -51475091 431135613 411607983 592969813 -270513340 -249310819 -167355467 908086473 -723506802 264887680 -919490842 -115369913 -721822344 249480696 -635600574 -710519485 691637118 884343362 -487619271 -7343780 -313260588 550938043 385564478 795268381 816633244 -626000641 -220839768 -791412211 214237029 739121149 798856670 -660845209 84550633 -194582167 -391793559 -728237260 572266022 159520766 583563644 -492320549 417086411 -531590555 497676543 -484874639 -726128875 232092136 -621212431 13325819 -568477486 940843961 426964473 -754087620 83336880 -207692319 145141158 401609031 -106028580 -903559402 -847776746 676735068 -249863523 639014412 -194775848 -799989527 -660083544 392588536 -916100191 -397354526 -290990120 -193606177 415386355 -99986259 939198467…
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 -989933655 -974708446 -963634653 -954442973 -954112620 -942860575 -937739729 -925831084 -919490842…

Example 2:

Input: 3440 536 554385468 565235866 117962152 415947516 -422856594 -122452964 927091587 527801322 423178565 451928557 460022335 -50422540 540732829 -504630310 447263950 355513548 70637033 937412351 -409657571 -991849151 -603544594 65918048 229592738 -860639539 880171392 -927143062 -286183000 -751783026 -411458286 836763210 -613107702 -370952459 -633447123 796002241 -660389224 -4102526 128779237 -785632038 341969054 -812319543 -276848260 -278436209 -877811329 -904629328 795644809 746402442 441390026 -434461605 -434011419 -906534549 -586218699 415056524 -988434585 339756211 -733922595 -203137673 -605158854 396380652 -782335307 851436439 538787902 -745879597 473402356 704595380 -395598189 -685128265 669795798 316080215 219889865 693250882 928565343 294687593 739436394 -248842688 276827965 493056121 …
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: 3315 1544 415464024 -436252408 840568108 -441985821 -193210192 -644959128 520302842 -618358426 111750826 273416882 429613932 -995192343 -710024677 289897055 607895753 -677265268 6319819 572426580 -953877884 734304885 558471284 611930235 703659142 -550142432 962221823 248903043 -294925493 -154040113 -381545945 737612885 873913232 733023015 -96132293 -886858815 70778815 -421726938 186013830 -82555226 425662516 596081769 -289940708 185163066 336276894 549017899 865347452 -871210402 274913089 -806696051 225915815 288191059 2939536 328445609 -962902507 73634751 -378650730 68838196 368770811 -589949853 479571888 955883225 -444014662 -129776226 685135081 -496709393 863522494 -752201655 -809745204 595348914 -352831068 -170540161 -189706087 -143619233 -885075291 -304186351 647349374 398784804 -3350…
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.