from heapq import heappush, heappop



X, Y, A, B, C = list(map(int, input().split()))

P = list(map(int, input().split()))

P.sort(reverse=True)

Q = list(map(int, input().split()))

Q.sort(reverse=True)

R = list(map(int, input().split()))

R.sort(reverse=True)



ans = sum(P[:X]) + sum(Q[:Y])





apples = []

for p in P[:X]:

    heappush(apples, [p, 0])



for q in Q[:Y]:

    heappush(apples, [q, 1])



for r in R:

    amin, rg = heappop(apples)

    if r >= amin:

        heappush(apples, [r, rg])

        ans += (r - amin)

    else:

        break



print(ans)
from heapq import heappush, heappop



X, Y, A, B, C = list(map(int, input().split()))

P = sorted(list(map(int, input().split())), reverse=True)

Q = sorted(list(map(int, input().split())), reverse=True)

R = sorted(list(map(int, input().split())), reverse=True)



ans = sum(P[:X]) + sum(Q[:Y])

apples = []

for p in P[:X]:

    heappush(apples, p)



for q in Q[:Y]:

    heappush(apples, q)



for r in R:

    amin = heappop(apples)

    if r >= amin:

        heappush(apples, r)

        ans += (r - amin)

    else:

        break



print(ans)
from heapq import heappush, heappop

X, Y, A, B, C = list(map(int, input().split()))
P = list(map(int, input().split()))
P.sort(reverse=True)
Q = list(map(int, input().split()))
Q.sort(reverse=True)
R = list(map(int, input().split()))
R.sort(reverse=True)
ans = sum(P[:X]) + sum(Q[:Y])
apples = []
for p in P[:X]:
    heappush(apples, [p, 0])
for q in Q[:Y]:
    heappush(apples, [q, 1])
for r in R:
    amin, rg = heappop(apples)
    if r >= amin:
        heappush(apples, [r, rg])
        ans += r - amin
    else:
        break
print(ans)

from heapq import heappush, heappop

X, Y, A, B, C = list(map(int, input().split()))
P = sorted(list(map(int, input().split())), reverse=True)
Q = sorted(list(map(int, input().split())), reverse=True)
R = sorted(list(map(int, input().split())), reverse=True)
ans = sum(P[:X]) + sum(Q[:Y])
apples = []
for p in P[:X]:
    heappush(apples, p)
for q in Q[:Y]:
    heappush(apples, q)
for r in R:
    amin = heappop(apples)
    if r >= amin:
        heappush(apples, r)
        ans += r - amin
    else:
        break
print(ans)

-P = list(map(int, input().split())) -P.sort(reverse=True) -Q = list(map(int, input().split())) -Q.sort(reverse=True) -R = list(map(int, input().split())) -R.sort(reverse=True) +P = sorted(list(map(int, input().split())), reverse=True) +Q = sorted(list(map(int, input().split())), reverse=True) +R = sorted(list(map(int, input().split())), reverse=True) -    heappush(apples, [p, 0]) +    heappush(apples, p) -    heappush(apples, [q, 1]) +    heappush(apples, q) -    amin, rg = heappop(apples) +    amin = heappop(apples) -        heappush(apples, [r, rg]) +        heappush(apples, r)