CF1805B.The String Has a Target
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
You are given a string s . You can apply this operation to the string exactly once: choose index i and move character si to the beginning of the string (removing it at the old position). For example, if you apply the operation with index i=4 to the string "abaacd" with numbering from 1 , you get the string "aabacd". What is the lexicographically minimal † string you can obtain by this operation?
† A string a is lexicographically smaller than a string b of the same length if and only if the following holds:
- in the first position where a and b differ, the string a has a letter that appears earlier in the alphabet than the corresponding letter in b .
输入格式
Each test contains multiple test cases. The first line contains the number of test cases t ( 1≤t≤104 ). The description of the test cases follows.
The first line of each test case contains a single integer n ( 1≤n≤105 ) — the length of the string.
The second line of each test case contains the string s of length n , consisting of lowercase English letters.
It is guaranteed that the sum of n over all test cases does not exceed 105 .
输出格式
For each test case, on a separate line print the lexicographically smallest string that can be obtained after applying the operation to the original string exactly once.
输入输出样例
输入#1
4 3 cba 4 acac 5 abbcb 4 aaba
输出#1
acb aacc abbcb aaab
说明/提示
In the first test case, you need to move the last character to the beginning.
In the second case, you need to move the second letter "a".
In the third set you need to apply the operation with i=1 , then the string will not change.