CT50783

Chetan and the Sterling ledgers

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Chetan runs the print shop at the old quarter of Brasshaven. Today the books show a list of ledgers, 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: 522 58 -721252717 -990262110 -635122927 -19683796 27286685 49850726 -556170996 374564100 -971755076 47248179 702521429 -303495875 -386130403 -549988489 -103756163 930830206 151299361 -935417515 -860780121 -942449871 664860923 292071665 750059586 112817885 62797605 -542078565 482549741 400421506 -622470098 893921712 -489735543 -559592295 687998595 132993634 236355621 -459934067 -450522907 62335767 901985319 -998166944 628206383 800132383 -676835712 -284504261 425259085 -722477844 -367050729 531091749 -783450694 -969285254 -776193786 -73075922 -674527261 644716679 -941958765 248230686 -661900260 837659115 45018500 -119530299 514184259 -188608353 293161643 495606578 -421952514 486813654 -169031532 -238174340 -548731407 801766028 844322606 -18838924 312886538 380130500 852508241 -761317376 -41…
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 -998166944 -990262110 -971755076 -969285254 -942449871 -941958765 -935417515 -860780121 -783450694 -776193786 -722477844 -721252717 -676835712 -674527261 -661900260 -635122927 -622470098 -559592295 -559592295 -556170996 -549988489 -548731407 -548731407 -548731407 -542078565 -542078565 -542078565 -542078565 -489735543 -459934067 -450522907 -421952514 -410904482 -410904482 -410904482 -386130403 -386130403 -367050729 -303495875 -303495875 -284504261 -238174340 -238174340 -213534839 -188608353 -169031532 -162859107 -137668225 -119530299 -119530299 -112800102 -112800102 -103756163 -103756163 -103756163 -73075922 -73075922 -480…

Example 2:

Input: 1812 1098 411974137 618295053 193006893 -399818140 59532412 790130726 -622435388 748268729 -665262215 642807774 559086123 324088260 884941979 89112593 772857116 -76559243 148397131 415104139 -890618228 -840901186 -838359385 823131975 -523559277 -119098571 653145060 674494830 550651571 251900277 -761687576 410534430 -783480191 -821354370 -90799108 -514048412 513447308 300502514 -211680903 -834859388 -353911255 -27844349 621353525 941203489 -719606720 833892774 142542222 -289118142 -199026779 -674626338 474624561 -971465324 -576373755 -686363340 -671529204 422739069 -276808331 561063320 -783445715 -398982100 250254956 -517683017 -424348594 383989482 361602521 601541705 -148302351 109647700 54174777 -520081576 -571715368 -7229377 -295266264 524912881 -112079359 -679674628 -201862467 259262449…
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: 1425 1368 -74928287 23437818 411018452 823930831 871271418 -302988255 -896147592 -812283614 414500656 -361890063 -867923145 607363952 400838944 58004232 -26679922 -860885416 220707081 529592741 354874814 -112740401 92299663 -11715206 -349790034 -376971801 -974301256 -497202890 25347055 -171761963 845930698 455434842 551435462 -701410715 -126202013 393042610 -41290597 -631482141 858268661 768228896 -594655553 833638868 -267611753 970358727 -47283577 640273625 868731169 431052241 -903425623 538719833 -339537197 944109573 -63078934 622157020 -298320664 853384253 298681732 217615532 174310069 228526015 -284599156 -37466266 53261313 -731474444 -712588448 -779947441 -890531373 -599360079 -756126553 -387459238 989467053 398610957 421514572 -152672829 265150394 -573996018 213847311 677919431 -5386…
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.
Chetan and the Sterling ledgers - MEDIUM Coding Problem | CodeTikki