CT43717

Notary and the Polished marks

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Every season at the spice bazaar of Saffronia, someone must secure the caravan contract. This year the task falls to Notary, armed only with the marks register. 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: 264 261 -624298241 94020605 739666445 288921609 -753186643 -770327868 -980642620 -956981491 -288482361 610638500 948416557 249960012 179414618 555179452 715871817 220506384 -907049519 833052859 -810235641 -51313784 -501590189 -397384908 -110896109 966899193 173565533 795257329 808488340 111606661 36860680 -890941107 -387110712 -225719367 763301532 444238281 -564278540 489860832 -674023963 -674469128 855734549 744299389 464550124 265117068 720716543 -111940051 623372751 -101714316 822226324 -497666247 -948460543 -691361993 -761308904 267604010 -928987370 -540003350 -857703033 -840371237 456524133 829528620 -701636844 360889479 595776699 5327805 -611406999 809160696 470995591 -969993828 356378101 85130636 985470522 24074639 58731706 -828954506 -75018186 122307330 -749783646 973075572 2553168…
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 -980642620 -97896449…

Example 2:

Input: 1241 1231 -865532498 -424369528 379464990 811435587 362075739 -247385111 461584325 -985086356 -209376252 704983531 -185711202 -536711788 525568228 220153698 87099387 662557573 145711396 -23247912 53040161 500061678 -342236915 -81939991 -115060913 837853256 728472143 -175344120 -291666498 -780668920 627693395 495203549 295310265 -952778552 843560332 781091850 761533676 91902334 -418792574 -754947087 820290562 416316903 720662289 768728663 -421031485 -161744783 893290595 858848421 423917940 321385383 -958570959 90317051 895170117 235927162 -506983912 281111300 462224120 -171094333 594797736 729009666 651652360 -689905156 96565595 288295738 140595856 699405456 228157052 -944378783 -541803237 720045339 533231624 400711532 952278000 -782669549 -233989872 857136017 80468995 -779963196 -640282786…
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: 1807 1631 839845025 246031578 891834431 -626742534 259938591 -555983186 728614968 -819570874 600328791 739546201 217402643 795371433 -650510968 -820587879 864360198 -125398235 -546047674 -921029918 700115195 -509560235 200513379 46395824 -227529221 -994924391 -736414613 173160687 504869292 816917116 513000476 488531235 -770916948 -107994086 215748534 -648567198 -530917963 460806065 598452851 -315048137 324912714 349889134 703975578 886435884 79679192 -914039045 677362089 -695971340 361002776 384727327 -910890949 -354821976 570043206 -179123044 472646409 -42280073 -180178925 -733304749 271523269 -417752128 26792055 549045794 -955443960 564341906 912539334 863003693 901965648 976579940 -170371005 -361653934 448160397 -34009598 525902698 -973425326 -14133076 -721497687 -754942636 -927866981 -…
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.