import
java.util.*;
class
GFG{
static
void
solve(
int
ar[],
int
n,
int
b[],
int
c[],
int
q)
{
Map<Integer, Integer> mp =
new
HashMap<>();
int
sum =
0
;
for
(
int
x =
0
; x < n; x++)
{
sum += ar[x];
mp.put(ar[x], mp.getOrDefault(ar[x],
0
) +
1
);
}
for
(
int
x =
0
; x < q; x++)
{
int
occur1 = mp.get(b[x]);
sum = sum - occur1 * b[x];
mp.remove(b[x]);
sum = sum + occur1 * c[x];
mp.put(c[x], mp.get(c[x]) + occur1);
System.out.print(sum +
" "
);
}
}
public
static
void
main (String[] args)
{
int
ar[] = {
1
,
2
,
3
,
4
};
int
n =
4
;
int
q =
3
;
int
b[] = {
1
,
3
,
2
};
int
c[] = {
2
,
4
,
4
};
solve(ar, n, b, c, q);
}
}