← 返回题目

题库练习 Permute Digits

← 上一题下一题 →

A11504 | $Permute Digits$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

You are given two positive integer numbers $a$ and $b$ . Permute (change order) of the digits of $a$ to construct maximal number not exceeding $b$ . No number in input and/or output can start with the digit 0. It is allowed to leave $a$ as it is.

输入格式

The first line contains integer $a$ ( $1<=a<=10^{18}$ ). The second line contains integer $b$ ( $1<=b<=10^{18}$ ). Numbers don't have leading zeroes. It is guaranteed that answer exists.

输出格式

Print the maximum possible number that is a permutation of digits of $a$ and is not greater than $b$ . The answer can't have any leading zeroes. It is guaranteed that the answer exists. The number in the output should have exactly the same length as number $a$ . It should be a permutation of digits of $a$ .

输入输出样例

输入 #1

123
222

输出 #1

输入 #2

3921
10000

输出 #2

输入 #3

4940
5000

输出 #3

C++ 编辑器

输入

输出