304953: CF940C. Phone Numbers
Memory Limit:256 MB
Time Limit:2 S
Judge Style:Text Compare
Creator:
Submit:0
Solved:0
Description
Phone Numbers
题意翻译
求长度为k,而且大于给定字符串的字符串,要求字典序最小。。。题目描述
And where the are the phone numbers? You are given a string $ s $ consisting of lowercase English letters and an integer $ k $ . Find the lexicographically smallest string $ t $ of length $ k $ , such that its set of letters is a subset of the set of letters of $ s $ and $ s $ is lexicographically smaller than $ t $ . It's guaranteed that the answer exists. Note that the set of letters is a set, not a multiset. For example, the set of letters of abadaba is $ {a,b,d} $ . String $ p $ is lexicographically smaller than string $ q $ , if $ p $ is a prefix of $ q $ , is not equal to $ q $ or there exists $ i $ , such that $ p_{i}<q_{i} $ and for all $ j<i $ it is satisfied that $ p_{j}=q_{j} $ . For example, abc is lexicographically smaller than abcd , abd is lexicographically smaller than abec, afa is not lexicographically smaller than ab and a is not lexicographically smaller than a.输入输出格式
输入格式
The first line of input contains two space separated integers $ n $ and $ k $ ( $ 1<=n,k<=100000 $ ) — the length of $ s $ and the required length of $ t $ . The second line of input contains the string $ s $ consisting of $ n $ lowercase English letters.
输出格式
Output the string $ t $ conforming to the requirements above. It's guaranteed that the answer exists.
输入输出样例
输入样例 #1
3 3
abc
输出样例 #1
aca
输入样例 #2
3 2
abc
输出样例 #2
ac
输入样例 #3
3 3
ayy
输出样例 #3
yaa
输入样例 #4
2 3
ba
输出样例 #4
baa