CT53496

Botanist's beacons K-th So Far

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

The measurer Botanist has been asked to secure the caravan contract. On the desk lies a long table of beacons readings. 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: 1133 1041 426452635 201667514 -513145825 446553032 307318720 -353390317 -482547667 -425444510 583471435 844204586 -33427797 -253146415 -875664660 686914500 660266844 -376756488 824526517 250592014 501866113 -661124989 499202697 304826091 929099322 839105675 -971925202 -699218219 469843008 67344823 -5207128 -577611939 214845051 -7193829 -731328446 744808962 -192437156 -432750608 -224149990 470320945 -700410463 478880481 -718423999 898292601 -445928580 848566357 547663125 -741396565 399325507 -465722585 600957649 230245665 -157391810 582463362 24599984 743233506 778902574 -694613517 -131040464 -238658701 825779554 503486007 496250711 313005121 -293855965 518382436 175680191 59219482 216545961 18750988 -91431813 -950975708 101127833 719258068 893801816 691411973 275860196 546351706 -796377251…
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: 382 146 179092235 601111144 798977401 -563969961 282574466 794636129 -49922459 -371451734 954470156 305113575 -262601529 831072961 974600892 131596112 -693060114 379598933 982557014 152897493 346437544 -135797848 -410591498 -843016000 -404914479 925562044 -674535172 -406085061 291932005 -420410665 -65388952 656488365 -706975123 968712443 218296375 -445723850 -638397965 -26297091 337397389 513017551 -510271761 -331219281 812872100 984432449 357015826 117374198 -803323097 -357685259 896195490 363301092 54790600 872514768 449362468 501867893 619818143 -804303702 -324595344 -275052255 -297171658 417687025 864305380 -927743489 -413950566 -855662002 -670082876 55736796 -825135204 386397447 -330144589 -835169020 170843373 494726620 843654837 -486850677 -381337202 -838422899 552365378 788801089 -6…
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 -997845551 -986045031 -958010259 -927743489 -872356436 -855662002 -843016000 -838422899 -835169020 -831247205 -831247205 -825135204 -804303702 -804303702 -804303702 -803323097 -746497196 -706975123 -706975123 -706975123 -706520275 -706520275 -698021197 -693060114 -691337579 -691337579 -690193237 -682787823 -681885095 -674535172 -673247869 -670082876 -670082876 -6…

Example 3:

Input: 93 80 -479276808 969065681 -143326139 -213374399 962668992 509162004 -204135271 285026971 -88198658 -453502931 -459319 217487513 954324893 -587277465 -556458109 -271415336 -705091685 546674328 759497661 431514238 -966671102 1345797 135833661 -894132305 -800632959 -828861573 609553387 -147700917 -533664996 -295001892 -177425347 -267539422 197326303 -142397127 -682015081 18978882 -430568307 -137811341 333674493 -36531855 -706363567 948508199 77927513 -833555072 967802369 831391410 -725122356 -944461245 -273113627 58172026 174526691 -246386360 639585195 -292376574 -537101593 -351172325 66558766 -991150576 -50759802 855606708 921288145 60265217 652858567 -194368733 -499982924 -187505806 189139498 -408768931 522331611 827883153 -540912077 27502679 82323320 942311986 -53415988 -635027948 -949870…
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 -991150576 -966671102 -949870306 -944461245 -894132305 -833555072 -828861573 -800632959 -800632959 -725122356 -725122356 -706363567 -705091685 -682015081

Constraints:

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

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