101604: [AtCoder]ABC160 E - Red and Green Apples

Memory Limit:256 MB Time Limit:2 S
Judge Style:Text Compare Creator:
Submit:0 Solved:0

Description

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

Input

题意翻译

你将要吃$X$个红苹果以及$Y$个绿苹果 你有$A$个红苹果,它们的美味值分别是$p_1,p_2...p_A$,以及$B$个绿苹果,美味值分别为$q_1,q_2...q_B$,以及$C$个无色苹果,美味值分别为$r_1,r_2...r_C$ 在吃无色苹果之前,你可以将它涂成红的或者绿的,然后这个苹果会按照红的或绿的苹果计数 你要从上面的苹果来选择要吃的,使得吃过的美味值尽可能大 找出将零个或更多无色苹果进行最佳着色时所能达到的吃掉苹果美味的最大可能总和。

加入题单

上一题 下一题 算法标签: