CT52245

The Reedmarsh K-th So Far

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

In the willow walks of Reedmarsh, Emir the quartermaster keeps careful count of the ledgers. Catalog the new acquisitions, 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: 2291 1974 704454710 -302322781 9453405 -610483456 -336768806 815398769 -303195421 358669503 757286283 885809374 142448602 509950306 -962730603 -48022930 -789867479 296421718 -602845455 -482787530 409401499 -416733293 -758931741 -150006994 -845264284 -525719994 -784647769 29877040 210621017 98350164 864826309 -707366383 -777846633 228284609 840719100 3537097 -234661799 82571101 967834961 -105805657 325706273 -468538208 -648693932 836158844 690015198 139492642 282473590 649662275 -447153304 772276666 592714169 -924101704 -174678989 -535534522 -847859505 113572378 -583117018 660808005 -363410253 141907478 762958600 -673611633 -900311928 -926234332 -712119679 -528962129 461531512 250697896 -843655634 -446555479 -693896679 -243789845 72397424 -62281837 -997596395 -442989733 -872139294 -90017128…
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: 71 24 8202392 869623639 749455730 -359880785 -602817656 96807078 -618948806 830396301 819098289 921645527 -984495689 -487587637 852098990 -571606267 -749690560 113240816 -29040894 -965824423 331057231 -370516123 -608430769 307244683 835677440 -851850329 -359611858 571303255 850331150 184844860 -788694428 154067895 920518424 108804069 -292855670 -467027562 641775024 662359127 -319584231 -131243787 494243020 548972619 -164799372 833680345 -707331349 334346500 273840890 -662641233 789114232 837303411 785063830 467990859 824410133 25224084 575850621 -670584131 953355461 92196612 571700847 102319754 921333147 507017936 803398643 -272215104 -778466948 -44080959 207273075 -297650483 -966709782 470466457 207922630 -17618864 -736663075
Output: -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -984495689 -965824423 -851850329 -749690560 -618948806 -618948806 -608430769 -602817656 -571606267 -487587637 -467027562 -370516123 -359880785 -359611858 -319584231 -292855670 -131243787 -131243787 -29040894 -29040894 8202392 96807078 96807078 108804069 113240816 154067895 184844860 273840890 273840890 307244683 307244683 331057231 331057231 334346500 334346500 467990859 494243020 507017936 507017936 507017936 507017936 507017936 507017936 507017936 507017936 507017936 507017936 507017936

Example 3:

Input: 2170 1445 842329782 203475775 -25664639 -648998492 237160786 -824200484 276920713 158127971 -698441014 611001243 931896957 -131024034 -450338666 -858512294 877437638 854097635 847175088 -360021186 868050351 -608458264 601584222 765125248 -738865250 859310196 657499635 -128749599 -138940676 241895693 -552785544 -257024823 929778379 -842322471 319340557 908868494 281115083 560407730 -896795277 -115437161 236941014 -86187426 857959619 714055541 -518908566 -814011571 -674649878 -906786773 -540506991 -192054207 -730462493 -703965875 -411877360 -533871854 -600957064 -870933721 139383408 -161433808 -926136738 796158894 568311289 991437481 -780623090 205403520 108318492 652937634 -961036198 -503792108 -230020918 -517970040 -741511472 322178545 314862881 236266646 -229719240 -890679062 949002468 -9…
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.
The Reedmarsh K-th So Far - MEDIUM Coding Problem | CodeTikki