CT37588

The K-th So Far of the Silent ledgers

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

The council of the seal rocks of Barking Cove pays by the answer, and Notary intends to earn it. First: the full register of ledgers. 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: 2592 327 748047810 777304584 -152153288 -554137076 -323992453 786180372 683858286 828071877 -666592521 -32409985 147969754 766259422 888346364 718929067 568515536 -355555304 -526895610 -233965396 779876764 282921883 -978996661 374223171 593391667 -381541563 -108659934 -180217898 -80707707 -784838936 -597675970 -985570576 -559188625 934609962 655255990 -670503878 126789425 465956740 280336094 207489879 -577347018 253468519 -7841911 833161865 -872414020 272725333 -538550222 -707476022 -866483229 -299129673 417054759 704713314 452570818 148400031 -402209575 -709166222 181745978 685701769 -720624641 126885350 -169091449 -199447935 -895989937 -71579030 -484656336 -750223651 568306084 -163128054 116988894 -185367433 -290364744 -637015208 804978307 743303276 -303516965 -116799031 441934091 288566…
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: 1108 433 -68747763 -731259636 -359142772 -112749207 85910534 289041016 -516330995 735714127 836954488 331809694 -85073931 599945634 -586095958 327652119 880164158 569093672 -128502897 -519363068 103289211 -123209847 543463447 632111499 354512128 -844654190 -893427394 -149754463 -395904034 869590608 -818577228 73523844 84190198 -690716942 521770285 797047980 819350586 141216800 -604090213 -424446959 114071078 647602380 -363499635 -127701896 267507722 944069552 -815501299 908369035 720416692 626100569 860963255 219692732 -715136144 -654235122 82113712 966914549 446953625 506271888 -61177970 -14759261 759276113 756857521 543537490 -401895329 -802677403 412164773 447920865 -370791185 -295931960 228703294 -211038438 222041813 -556428953 -52194705 739780323 472814028 392855811 733760656 28738553…
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: 3312 1028 -401814692 830520145 208045822 725691927 102609431 -713231161 411392609 742600931 829385033 -388503656 732254831 -372402545 373795728 159260875 -342190465 -175999098 826963032 845585681 899063329 -303998134 66933530 -756555542 -169612546 -757701372 -293297112 1794913 -437353183 -632629699 -350985955 316883231 -945241025 66379546 -611648127 3507198 -244759272 506397373 63728792 -674214909 269319579 355678370 840148165 -533937878 336485303 473045608 133519554 -72405166 -564132208 -542232633 49373400 549536483 409166653 -732830181 -979129526 39011139 719518804 -612225094 642691161 787120152 953845718 512833288 -435646181 -740574545 -845867828 -648125477 964789491 -840714129 208963760 -89023686 -431121902 -943206554 857123798 35931403 -482737269 579968931 -796232614 -768048420 836537…
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 K-th So Far of the Silent ledgers - MEDIUM Coding Problem | CodeTikki