CT49985

Ruby signals K-th So Far

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

In the rookery of Crowhaven, Smith the scribe keeps careful count of the signals. Secure the caravan contract, every figure matters. 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: 3271 2551 -512488043 -273464639 467431975 -976127934 864873478 116606589 -107660133 -417706156 -746849841 -529874033 -334772590 630280783 581567581 -474248854 -87190292 -524670042 -714187523 336487749 327846988 -280434248 685963275 -182594598 543478102 -648321603 -807923561 656668171 798498644 869311791 298272973 214859564 -785057783 -316286149 -19145341 593643213 -359082929 998321759 -524022804 -650920533 -770610797 216266755 -589269227 499973833 -613971093 303723041 29827518 -851033306 405508669 835851070 142768799 -681367552 758658569 677750765 -677020176 700311170 -246737072 -487893451 66574307 -899707581 297890087 -941383730 -736249939 327472061 826155571 -590340764 447372189 239993477 -733931493 105606074 -191721889 830303310 947408415 -399326788 642833648 499499263 725207633 -734656…
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: 3959 1511 71679763 383739300 383336244 791589838 854412609 -128670944 -589246661 -451805530 743662113 535761984 -265058310 -33986467 548326051 319732662 541200561 -795511000 -464655259 -229473945 -810601785 159791720 -238161195 -239857128 293853960 -883713850 -505899601 -695228012 -675005654 -152759755 95938018 -309170089 -176414671 334458136 -346012923 570924367 588316466 580299069 -190648622 582748432 344488814 -199350210 -528673532 -334695958 -926347786 -447678246 612289852 146156952 625839956 -655617533 335751063 120569857 239793729 525888627 -770204877 -168444306 316441472 -355694773 809032118 890042327 165524746 458639776 526434388 613087633 -366968319 646323777 210539500 -452984447 558154008 -318041471 837885559 -22444320 -137380023 -18495738 -764495594 755731919 426639894 -77600462…
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: 2899 124 793702106 -253859840 407210596 902311890 -737547622 843230421 -486483840 -729065237 -808623467 -598552321 -91175219 823875625 750785658 -635054875 -5662392 144222512 -42688901 274834500 -256230054 -231680673 -462916951 -314518 -775607156 217545412 467585450 -887923950 -7666551 749555488 -101081877 -40793685 53073517 766259154 -537837642 -399683038 601126227 -292686160 -133472054 421177706 616326493 -92988146 -936124913 -681641934 323674754 684554721 -501998630 -268520725 698781566 -941029536 -129698536 243687124 321436801 397506147 721388624 -286857989 397123749 -920784626 -451927182 524532879 422762495 -100472722 280428136 -325229219 -805683500 -933574661 -421491975 841735632 18048495 -539066728 88295502 -236436923 -108079626 -681886363 -787495809 764809341 -33418894 -29649066 26…
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 -970199509 -969002678 -941029536 -936124913 -933574661 -920784626 -920784626 -887923950 -839142475 -808623467 -805683500 -805683500 -787495809 -786794005 -775607156 -775607156 -737547622 -729065237 -723481665 -689693145 -689097662 -681886363 -681641934 -679241574 -652924553 -635054875 -598552321 -590869081 -565463674 -565463674 -542247441 -539066728 -539066728 -537837642 -515977827 -501998630 -486483840 -483436256 -462916951 -4…

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Ruby signals K-th So Far - MEDIUM Coding Problem | CodeTikki