题库练习 Search for Pretty Integers
← 上一题 下一题 →

A11190 | Search for Pretty Integers

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

You are given two lists of non-zero digits.

Let's call an integer pretty if its (base $10$ ) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty integer?

输入格式

The first line contains two integers $n$ and $m$ ( $1<=n,m<=9$ ) — the lengths of the first and the second lists, respectively.

The second line contains $n$ distinct digits $a_{1},a_{2},...,a_{n}$ ( $1<=a_{i}<=9$ ) — the elements of the first list.

The third line contains $m$ distinct digits $b_{1},b_{2},...,b_{m}$ ( $1<=b_{i}<=9$ ) — the elements of the second list.

输出格式

Print the smallest pretty integer.

输入输出样例

输入 #1
2 3
4 2
5 7 6
输出 #1
25
输入 #2
8 8
1 2 3 4 5 6 7 8
8 7 6 5 4 3 2 1
输出 #2
1
C++ 编辑器
输入
输出