CT54603

Xara and the Amber registers

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Caravans arrive at the fen lights of Will-o-Wisp with crates of registers, and Xara the clerk must account for every last one. 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: 683 64 -683208582 -657052185 912220499 947088115 -991030340 186730880 817949605 -161023258 595954278 -304640371 68448141 -348659707 46097743 379301122 844182568 -335828874 238043353 -51563935 802939452 860873446 -468082084 -679134135 361693390 -152759987 -49537910 791796483 -87862312 -410468849 47131059 -55985964 940533423 293748614 -708028346 966401786 738524478 -939235536 770906838 -166992666 -229311739 -254366600 -405320221 -489409343 657074087 -337436264 -906445307 -38101657 808169033 -811542200 -941580466 196517056 -208857394 -157066867 -370121355 43333527 -135756162 -545828796 -488675274 -574377295 997216930 -471756127 -631922848 -22459060 431440358 -282044853 887436041 377306131 -722623864 -169330770 309245679 -672708954 203093091 -775679433 119270963 -293109474 314223522 845518033 …
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 -991030340 -941580466 -939235536 -906445307 -811542200 -722623864 -708028346 -683208582 -683208582 -679134135 -672708954 -657052185 -631922848 -631713880 -574377295 -545828796 -545828796 -545828796 -489409343 -488675274 -488675274 -471756127 -468082084 -410468849 -410468849 -405320221 -405320221 -393796797 -370121355 -348659707 -337436264 -337436264 -335828874 -306830003 -306830003 -304640371 -293109474 -282044853 -254366600 -229311739 -208857394 -204602146 -180817257 -180817257 -169330770 -166992666 -166992666 -166992666 -161023258 -157066867 -152759987 -135756162 -123110607 -123110607 -102591747 -10168…

Example 2:

Input: 3959 2636 -280531566 -802818897 -616311001 825444748 548715740 584327160 748724931 843634126 96367175 963932999 980550282 -367266917 689063270 -701565722 780668204 68252474 238172929 -323961650 -44473603 -374226774 759326010 447236036 311873500 -255570107 478469019 -17796469 892134948 -117304148 200935310 340976191 593929526 673038232 640535896 805393269 401191689 524756476 -26029568 -810792441 -775220461 -986506816 899927223 -971446633 426704601 12767293 -999279493 508835352 673283240 -412676157 -262112909 568465557 472581244 267113129 -959281515 997524533 188032105 861829658 -64492087 -870847052 -527589649 758148776 -178861072 -570037711 -189720229 810771270 -698575493 791449521 -862204085 -60059531 -904128523 38055841 393116814 -514875878 -384362169 660968138 -657323452 889231337 132087…
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: 3294 647 -411997256 831522345 259627596 -154747177 16867997 -902141608 595771429 -547524076 -642855863 743124867 531193182 134257886 -208847467 -169993113 -680900201 710954508 52150360 -380161124 659491199 947792237 171708142 722961403 -788702778 596182747 396121003 -726805692 841557026 -541959804 540802011 985493154 859144348 -579477786 196967074 202891963 -943577347 -225276093 294282956 -899455930 27325640 377796446 438776616 -234804044 -506769130 -282196688 691248492 160275336 29684955 713641937 79364794 -861353892 -318376984 295892335 333472524 899288933 -974453672 -838884318 -311859325 -865771258 -214081517 -607408835 -97527691 915684248 944846313 -770218801 585850057 -771037584 466692821 -974685037 245010050 477473325 678506952 -205221866 672233699 -884061364 630716491 98453555 48812…
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.
Xara and the Amber registers - MEDIUM Coding Problem | CodeTikki