Problem:
Score : 500 points

Problem Statement

You are going to eat X red apples and Y green apples.

You have A red apples of deliciousness p_1,p_2, \dots, p_A, B green apples of deliciousness q_1,q_2, \dots, q_B, and C colorless apples of deliciousness r_1,r_2, \dots, r_C.

Before eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.

From the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.

Find the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.

Constraints

1 \leq X \leq A \leq 10^5

1 \leq Y \leq B \leq 10^5

1 \leq C \leq 10^5

1 \leq p_i \leq 10^9

1 \leq q_i \leq 10^9

1 \leq r_i \leq 10^9

All values in input are integers.

Input

Input is given from Standard Input in the following format:

X Y A B C
p_1 p_2 ... p_A
q_1 q_2 ... q_B
r_1 r_2 ... r_C

Output

Print the maximum possible sum of the deliciousness of the eaten apples.

Sample Input 1

1 2 2 2 1
2 4
5 1
3

Sample Output 1

12

The maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:

Eat the 2-nd red apple.

Eat the 1-st green apple.

Paint the 1-st colorless apple green and eat it.

Sample Input 2

2 2 2 2 2
8 6
9 1
2 1

Sample Output 2

25

Sample Input 3

2 2 4 4 4
11 12 13 14
21 22 23 24
1 2 3 4

Sample Output 3

74

Solution in LuaJIT (2.0.4) (judge verdict: Accepted)

local r_eat, g_eat, r_num, g_num, a_num 
= io.read("*n", "*n", "*n", "*n", "*n")

local function writeList(num)
    local list = {}
    for i = 1, num do
        list[i] = io.read("*n")
    end
    return list
end

local r_taste = writeList(r_num)
local g_taste = writeList(g_num)
local a_taste = writeList(a_num)

table.sort(r_taste, function(x, y) return x > y end)
table.sort(g_taste, function(x, y) return x > y end)
table.sort(a_taste, function(x, y) return x > y end)
for i = 1, r_num - r_eat do
    r_taste[#r_taste] = nil
end
for i = 1, g_num - g_eat do
    g_taste[#g_taste] = nil
end

local function removeMin(list1, list2, list3)
    if     list3 and (list1[#list1] <= list2[#list2]) then
        table.remove((list1[#list1] <  list3[#list3]) and list1 or list3)
    elseif list3 and (list2[#list2] <  list1[#list1]) then
        table.remove((list2[#list2] <  list3[#list3]) and list2 or list3)
    else
        table.remove((list1[#list1] <  list2[#list2]) and list1 or list2)
    end
end

for i = 1, #a_taste do
    if r_taste[#r_taste] and g_taste[#g_taste] and a_taste[#a_taste] then
        removeMin(r_taste, g_taste, a_taste)
    elseif r_taste[#r_taste] and g_taste[#g_taste] then
        removeMin(r_taste, g_taste)
    elseif g_taste[#g_taste] and a_taste[#a_taste] then
        removeMin(g_taste, a_taste)
    elseif a_taste[#a_taste] and r_taste[#r_taste] then
        removeMin(a_taste, r_taste)
    elseif r_taste[#r_taste] then
        table.remove(r_taste)
    elseif g_taste[#g_taste] then
        table.remove(g_taste)
    elseif a_taste[#a_taste] then
        table.remove(a_taste)
    end
end

local function samList(list)
    local result_sam = 0LL
    for i = 1, #list do
        result_sam = result_sam + list[i]
    end
    return result_sam
end
local result = 0LL
result = samList(r_taste) + samList(g_taste) + samList(a_taste)

print(tostring(result):sub(1, -3))