Mock CCC '21 S3 - Lexicographically Smallest Permutation Subsequence

Points: 10 (partial)

Time limit: 0.1s

Java 0.25s

Python 3 0.5s

Memory limit: 1G

Problem type

Given a list of $N$ ~N~ positive integers, none larger than $K$ ~K~, compute the lexicographically smallest permutation of the first $K$ ~K~ positive integers that is a subsequence of the list.

Constraints

$1 \le K \le N \le 2 \cdot 10^5$ ~1 \le K \le N \le 2 \cdot 10^5~

Each integer from $1$ ~1~ to $K$ ~K~ appears at least once in the list.

Input Specification

The first line contains two space-separated integers $N$ ~N~ and $K$ ~K~. Each of the next $N$ ~N~ lines contains a single integer, the integers of the list in order.

Output Specification

Output $K$ ~K~ space-separated integers, the lexicographically smallest permutation that is a subsequence.

Sample Input

Sample Output

2 1 3

Comments

2

zhenga1 commented on Feb. 15, 2021, 7:45 a.m.

Can I ask why I am getting presentation error?

2

Aaeria commented on Feb. 16, 2021, 4:24 p.m.

you have to remove trailing spaces and end with a newline