import
java.util.*;
class
GFG
{
static
int
findlargestAfterDel(
int
arr[],
int
m,
int
del[],
int
n)
{
HashMap<Integer,
Integer> mp =
new
HashMap<Integer,
Integer>();
for
(
int
i =
0
; i < n; ++i)
{
if
(mp.containsKey(del[i]))
{
mp.put(del[i], mp.get(del[i]) +
1
);
}
else
{
mp.put(del[i],
1
);
}
}
int
largestElement = Integer.MIN_VALUE;
for
(
int
i =
0
; i < m; i++)
{
if
(mp.containsKey(arr[i]))
{
mp.put(arr[i], mp.get(arr[i]) -
1
);
if
(mp.get(arr[i]) ==
0
)
mp.remove(arr[i]);
}
else
largestElement = Math.max(largestElement, arr[i]);
}
return
largestElement;
}
public
static
void
main(String[] args)
{
int
array[] = {
5
,
12
,
33
,
4
,
56
,
12
,
20
};
int
m = array.length;
int
del[] = {
12
,
33
,
56
,
5
};
int
n = del.length;
System.out.println(findlargestAfterDel(array, m, del, n));
}
}