CT41075

Tanya Counts the signals

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

The council of the alabaster quarry of Whitestone pays by the answer, and Tanya intends to earn it. First: the full register of signals. 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: 3106 238 -133835622 -11662934 13685309 -361402419 639789851 741365319 143447538 -560861783 -818493822 -69355325 462214757 -557077382 -330590140 -611247170 36901659 -136151982 416096329 -379206611 660872176 -891867415 -167067266 636372320 -81355274 -707261896 840017691 730880736 -547512089 955373002 568691944 864054018 559125433 -625442891 -889398861 -780552830 513242468 431318234 -572179242 89693048 -885833154 -528302898 -163742372 255410192 903334653 951507246 -902658663 803012950 -391773931 907646550 204721414 -85806276 423609351 743967262 692784374 -591253681 975396524 739157411 -330911475 -52403068 -487973198 -5226515 922856930 -267929872 -999542797 -524781506 535289576 -609626695 -169082375 500595026 -247908486 -939174192 438673717 -469053915 -109689158 738598560 616494699 -432934411 …
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 -999542797 -999095197 -998870784 -992469662 -987553094 -978035148 -974832916 -968431841 -…

Example 2:

Input: 2306 2186 -239026228 -625066824 202223615 399706477 516573711 54029722 -234511260 706913457 -810377518 788282630 519405032 -571061451 -499166662 44295261 943881804 -245465232 -78062856 -150139013 446673423 656027666 529786935 516845063 -621192313 40246485 -126120742 -668273271 656934642 351471624 -347780023 321869091 837709767 96606212 997388694 351519860 -557311492 -305634026 -606180992 -359910640 -697335900 646850603 514532090 544973855 76236223 -299065961 -487813255 -747827728 628567160 -970852666 -414806118 711817023 583860801 -347345888 -459790919 -132270779 770319603 -334977092 -624236090 298551367 758496020 -762775814 -116188404 -407314035 221991892 443098940 -271003463 480500527 749672722 -324322831 515828303 -968320846 -50472706 -278473585 263928397 23365773 -192295927 -789222643 …
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: 1788 1445 -731263746 -992416856 -767515892 -510912070 -793113808 -658635954 -935153368 -365829637 759290088 -48685046 821350470 146977612 213149802 471575465 329889303 -521292275 -809151507 -122861796 758999631 -554006445 -211064832 -373017835 -321597546 389554965 912004231 -840169614 -190870665 176644471 -702435774 257410143 -169870814 -375191162 54057847 703757724 -300662257 -60618319 -903691132 -377169801 215463441 689155794 -582401440 65224051 564682617 -992978235 698149421 -602287925 253451024 -526098046 779326942 39680961 274016619 802386819 -889504210 581112266 -917127361 774627056 234708790 275313969 189652426 464800321 140245501 709526361 618569208 -639505228 -374883219 -896956589 137332347 -760689697 -136016498 -110826365 -94698411 135499079 625542107 -51577753 -258881987 1160450…
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.