[Solution] Lex String Codeforces Solution | Codeforces Problem Solution 2022

[Solution] Lex String Codeforces Solution | Codeforces Problem Solution 2022

A. Lex String

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Kuznecov likes art, poetry, and music. And strings consisting of lowercase English letters.

Recently, Kuznecov has found two strings, a$a$ and b$b$, of lengths n$n$ and m$m$ respectively. They consist of lowercase English letters and no character is contained in both strings.

Let another string c$c$ be initially empty. Kuznecov can do the following two types of operations:

• Choose any character from the string a$a$, remove it from a$a$, and add it to the end of c$c$.
• Choose any character from the string b$b$, remove it from b$b$, and add it to the end of c$c$.

But, he can not do more than k$k$ operations of the same type in a row. He must perform operations until either a$a$ or b$b$ becomes empty. What is the lexicographically smallest possible value of c$c$ after he finishes?

Solution Click Below:-  CLICK HERE

A string x$x$ is lexicographically smaller than a string y$y$ if and only if one of the following holds:

• x$x$ is a prefix of y$y$, but x≠y$x\ne y$;
• in the first position where x$x$ and y$y$ differ, the string x$x$ has a letter that appears earlier in the alphabet than the corresponding letter in y$y$.

Input

There are several test cases in the input data. The first line contains a single integer t$t$ (1≤t≤100$1\le t\le 100$) — the number of test cases. This is followed by the test cases description.

Lex String Codeforces Solution

Mystic Permutation Codeforces Solution 

Infected Tree Codeforces Solution

Lena and Matrix Codeforces Solution

ANDfinity Codeforces Solution

The first line of each test case contains three integers n$n$, m$m$, and k$k$ (1≤n,m,k≤100$1\le n,m,k\le 100$) — parameters from the statement.

The second line of each test case contains the string a$a$ of length n$n$.

The third line of each test case contains the string b$b$ of length m$m$.

The strings contain only lowercase English letters. It is guaranteed that no symbol appears in a$a$ and b$b$ simultaneously.

Output

In each test case, output a single string c$c$ — the answer to the problem.