-
Notifications
You must be signed in to change notification settings - Fork 5
/
Copy pathTwoArraysAndSwap.java
67 lines (61 loc) · 1.64 KB
/
TwoArraysAndSwap.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
/*https://codeforces.com/problemset/problem/1353/B*/
import java.io.InputStreamReader;
import java.io.BufferedReader;
import java.io.IOException;
import java.util.Arrays;
public class TwoArraysAndSwap
{
public static void main(String[] args)throws IOException
{
BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
int testCases = Integer.parseInt(bufferedReader.readLine());
String[] tokens;
int n, k, i, left, right, sumA = 0, sumB = 0, temp;
int[] a, b;
boolean printed = false;
while (testCases-- > 0)
{
printed = false;
tokens = bufferedReader.readLine().trim().split(" +");
n = Integer.parseInt(tokens[0]);
k = Integer.parseInt(tokens[1]);
a = new int[n];
b = new int[n];
sumA = sumB = 0;
tokens = bufferedReader.readLine().trim().split(" +");
for (i = 0; i < n; ++i) a[i] = Integer.parseInt(tokens[i]);
tokens = bufferedReader.readLine().trim().split(" +");
for (i = 0; i < n; ++i) b[i] = Integer.parseInt(tokens[i]);
Arrays.sort(a); Arrays.sort(b);
left = 0;
right = n-1;
if (a[left] >= b[right])
{
sumA = 0;
for (i = 0; i < n; ++i) sumA += a[i];
System.out.println(sumA);
printed = true;
}
if (printed) continue;
for (i = 0; i < k; ++i)
{
temp = a[left];
a[left] = b[right];
b[right] = temp;
++left; --right;
if (left < n && right >= 0 && a[left] >= b[right])
{
sumA = 0;
for (i = 0; i < n; ++i) sumA += a[i];
System.out.println(sumA);
printed = true;
break;
}
}
if (printed) continue;
sumA = 0;
for (i = 0; i < n; ++i) sumA += a[i];
System.out.println(sumA);
}
}
}