CT45006

Scribe and the K-th So Far

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Legend says the vault under the cliffside roost of Stormrest opens only for a perfect tally of marks. Scribe means to find out. 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: 1676 1060 -508673914 -673930256 -223067081 966489023 773258877 -596317471 -207795417 500935476 -48490861 -123234002 -65244361 67566180 -780053187 -833791766 -393700749 560122834 -411700260 645494949 -111948280 399008948 104667269 -405372833 -229563645 -475097326 210138434 -609198199 -380645531 843887897 -876956500 15455454 949924654 -357474792 764719144 308155736 -877228352 603494821 -820429621 302173257 -824381431 -452644413 500017348 -3342132 -129876443 -762256418 -509305945 486656456 414000626 178315085 -379566161 -437065999 118394104 923355113 302685411 98627017 432415817 -505703733 960685190 976108815 62621468 -182416938 566822785 336465710 630116878 857516126 -382175464 645930876 398345312 585478770 81679958 -833384273 888024001 383723147 42443408 538080140 -719909021 -282635693 -261…
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: 465 324 438408926 -87582510 -439802878 -237343340 -236130614 411825621 -620489150 771835232 365712141 -725137189 939667843 477353500 223674497 -879330106 983091279 -350237504 693047718 877823881 546012798 -235752722 -520544739 -71185535 -87446687 -988300080 197005485 -154377148 671827925 -687333888 -48553211 252644145 -906005149 -335290674 231396807 -37979315 -183697941 -409622733 840193397 101592522 20799436 -962435729 -332436069 99947572 -371730292 -600731477 -804355879 -274065804 461726874 -352142721 -659046644 -398989339 -628270278 410881983 483795466 251610870 -47027561 -958109427 790214061 771127691 960923404 526330970 749759006 922583253 -727689724 198433748 453445745 158016434 -156935358 -829904427 517145817 669533166 293281551 -547058719 -562674681 -534931672 -574394583 383087693 …
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: 2117 2056 579136122 31481149 911314960 -467981043 -766966625 899397388 -688429240 -920802399 -913539335 649971529 135824158 966878900 294469783 -148769376 849521408 -116678061 662509628 -851263495 481229919 -533462847 -130071525 -267218100 564445736 -826956634 -800644430 893419077 930269985 251247712 128220704 -805713272 -806668762 475182433 505405180 -327126676 714572282 178022815 300583919 666530571 710059498 994271182 471757456 -978137114 -204457624 798729365 568948219 -904382338 -882249788 610946972 970010359 721203106 -478270755 37505830 141410559 -274962598 654285511 716123528 -765590299 -43037517 416572158 82137870 814340215 -173441757 382949359 -366070672 526915074 357269645 -528602308 -308555279 -460598976 -596873842 -819598295 -84275038 -651423461 316199513 -674167907 -957659422 …
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.
Scribe and the K-th So Far - MEDIUM Coding Problem | CodeTikki