A13376 | $Two Arrays And Swaps$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

You are given two arrays $a$ and $b$ both consisting of $n$ positive (greater than zero) integers. You are also given an integer $k$ . In one move, you can choose two indices $i$ and $j$ ( $1 \le i, j \le n$ ) and swap $a_i$ and $b_j$ (i.e. $a_i$ becomes $b_j$ and vice versa). Note that $i$ and $j$ can be equal or different (in particular, swap $a_2$ with $b_2$ or swap $a_3$ and $b_9$ both are acceptable moves). Your task is to find the maximum possible sum you can obtain in the array $a$ if you can do no more than (i.e. at most) $k$ such moves (swaps). You have to answer $t$ independent test cases.

The first line of the input contains one integer $t$ ( $1 \le t \le 200$ ) — the number of test cases. Then $t$ test cases follow. The first line of the test case contains two integers $n$ and $k$ ( $1 \le n \le 30; 0 \le k \le n$ ) — the number of elements in $a$ and $b$ and the maximum number of moves you can do. The second line of the test case contains $n$ integers $a_1, a_2, \dots, a_n$ ( $1 \le a_i \le 30$ ), where $a_i$ is the $i$ -th element of $a$ . The third line of the test case contains $n$ integers $b_1, b_2, \dots, b_n$ ( $1 \le b_i \le 30$ ), where $b_i$ is the $i$ -th element of $b$ .

For each test case, print the answer — the maximum possible sum you can obtain in the array $a$ if you can do no more than (i.e. at most) $k$ swaps.

输入 #1

5
2 1
1 2
3 4
5 5
5 5 6 6 5
1 2 5 4 3
5 3
1 2 3 4 5
10 9 10 10 9
4 0
2 2 4 3
2 4 2 3
4 4
1 2 2 1
4 4 5 4

输出 #1

C++ 编辑器

输入

输出