CT43025

Squire and the Brass registers

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Squire runs the shed at the maple sugarbush of Saprun. Today the books show a list of registers, and the numbers must be worked out before sundown. 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: 3912 2055 -557466873 -40738349 28567470 53257755 245672849 -87177369 -205575701 129452964 480080896 -942668338 -197181861 -95666850 -258729361 -210941226 246043251 -865044683 742194254 249286422 -278928902 -706599886 -976684153 482940988 -723314709 176499651 -30634865 198588319 -63522032 -860564080 -26870567 -73568580 471241147 124211676 366776747 232717612 -738545094 -358720649 630584700 516531560 -394992241 -373296685 371070809 -845431451 -7819265 892427631 -843792652 -792053159 -489219181 811324399 -975122125 12742351 -102924045 678612672 616035054 421646772 535819302 451957367 -606806428 671774127 246646660 611648544 218877878 -829614496 -560432194 899755450 810639768 -102972933 635375181 -872555108 -565593705 511421796 40540146 -269342546 658059425 858227988 -595933116 -989552907 -827…
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: 2359 1860 -996588368 144625274 130561009 -549330634 340771963 641121773 20613575 154138916 -530508081 -412285003 140247378 117449677 -445949923 -595555502 736876436 767856431 981325513 -665146378 712257327 -693595289 621466629 -689135909 -808414903 -247678379 -533008669 -667046605 106820990 244262899 -243920708 298632526 -493501666 -961244326 727675266 102177097 -435764775 805648689 -568023269 -159861606 -37535398 -366214793 285883424 -135477902 -842026426 -873482159 -902007627 359759320 729468868 -829447201 -463610760 540223452 179416468 -181164482 310065993 -183899732 687435957 -817183986 -312896488 69894545 -956784782 -936249931 175230074 345180614 -115559195 428070986 101988724 -420666696 -720335534 989172744 244796576 976724268 -759769919 -913392567 525189639 402007093 -390318849 -128…
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: 550 266 469819268 229823409 8001843 -540808770 -672405491 370233163 -652934058 40559078 -83727539 219816265 -288186268 775480149 956414823 830815623 -154924584 212429904 577755859 840785545 -780830323 342789894 595596939 200291565 -279993232 -585350919 -622012594 -540056793 649570134 -517369939 344997110 -201064888 739248428 -722249525 -21747348 361773510 -990271358 -857160563 -397933744 -136919059 584408254 -152533862 -212336224 501089003 -406397529 334932242 394510362 13006039 35058376 -706257140 -59310196 -101211861 -876016905 350686806 458237199 204150903 400800604 398642647 409711247 598814573 668154122 961087970 419774033 217382811 -466590133 -555972244 631195524 34570791 -109538657 688851507 484122007 -951975365 920183881 -733763828 -486191037 -888532553 540898593 -601914240 2989065…
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 -9967…

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Squire and the Brass registers - MEDIUM Coding Problem | CodeTikki