codeforces 872aSearch for Pretty Integers

codeforces 872aSearch for Pretty Integers

​​ 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?

Input 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 a1, a2, …, an (1 ≤ ai ≤ 9) — the elements of the first list.

The third line contains m distinct digits b1, b2, …, bm (1 ≤ bi ≤ 9) — the elements of the second list.

Output Print the smallest pretty integer.

Examples Input 2 3 4 2 5 7 6 Output 25 Input 8 8 1 2 3 4 5 6 7 8 8 7 6 5 4 3 2 1 Output 1 Note In the first example 25, 46, 24567 are pretty, as well as many other integers. The smallest among them is 25. 42 and 24 are not pretty because they don’t have digits from the second list.

In the second example all integers that have at least one digit different from 9 are pretty. It’s obvious that the smallest among them is 1, because it’s the smallest positive integer.

#include#includeusing namespace std;int n,m,a[10],b[10];int main(){// freopen("cf.in","r",stdin); scanf("%d%d",&n,&m); for (int i=1;i<=n;++i) scanf("%d",&a[i]);sort(a+1,a+n+1); for (int i=1;i<=m;++i) scanf("%d",&b[i]);sort(b+1,b+m+1); for (int i=1;i<=n;++i){ for (int j=1;j<=m;++j) if (a[i]==b[j]) { printf("%d",a[i]);return 0; } } if (a[1]

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。