文章目录
一、B. Two Arrays And Swaps
总结
一、B. Two Arrays And Swaps
本题链接：Two Arrays And Swaps
题目：
B. Two Arrays And Swaps
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
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≤i,j≤n) and swap ai and bj (i.e. ai becomes bj and vice versa). Note that i and j can be equal or different (in particular, swap a2 with b2 or swap a3 and b9 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.
Input
The first line of the input contains one integer t (1≤t≤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≤n≤30;0≤k≤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 a1,a2,…,an (1≤ai≤30), where ai is the i-th element of a. The third line of the test case contains n integers b1,b2,…,bn (1≤bi≤30), where bi is the i-th element of b.
Output
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.
Example
input
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
output
6
27
39
11
17
Note
In the first test case of the example, you can swap a1=1 and b2=4, so a=[4,2] and b=[3,1].
In the second test case of the example, you don’t need to swap anything.
In the third test case of the example, you can swap a1=1 and b1=10, a3=3 and b3=10 and a2=2 and b4=10, so a=[10,10,10,4,5]and b=[1,9,3,2,9].
In the fourth test case of the example, you cannot swap anything.
In the fifth test case of the example, you can swap arrays a and b, so a=[4,4,5,4] and b=[1,2,2,1].
本博客给出本题截图：
题意：一共t组测试，每组测试包括n(数组长度)，k(最多交换次数)，每次最多可以交换k次(a数组和b数组)，求交换后数组a中元素总和最大是多少
AC代码
#include <iostream> #include <algorithm> using namespace std; const int N = 35; int a[N], b[N]; int main() { int t; cin >> t; while (t -- ) { int n, k; cin >> n >> k; for (int i = 0; i < n; i ++ ) cin >> a[i]; for (int i = 0; i < n; i ++ ) cin >> b[i]; sort(a, a + n); sort(b, b + n); int j = n - 1; for (int i = 0; i < k; i ++ ) { if (a[i] >= b[j]) break; swap(a[i], b[j --]); } int res = 0; for (int i = 0; i < n; i ++ ) res += a[i]; cout << res << endl; } return 0; }
总结
水题，不解释
