-
-
Notifications
You must be signed in to change notification settings - Fork 0
/
permutingtwoarray.java
59 lines (38 loc) · 1.22 KB
/
permutingtwoarray.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
import java.io.*;
import java.util.*;
public class Solution {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
int Q = input.nextInt();
//Store answer to each query
StringBuilder output = new StringBuilder("");
queries:
for(int q = 0; q < Q; q++)
{
int n = input.nextInt();
int k = input.nextInt();
//Initialize Input
int[] A = new int[n];
int[] B= new int[n];
for(int i = 0; i < n; i++)
A[i] = input.nextInt();
for(int i = 0; i < n; i++)
B[i] = input.nextInt();
Arrays.sort(A);//Sort ascending
Arrays.sort(B);//Sort acending
for(int i = 0; i < n; i++)
{
//Traverse A ascending and B descending
if(A[i]+B[B.length-1-i] < k) //Failed check
{
output.append("NO\n");
continue queries;
}
}
//Permutation exist
output.append("YES\n");
}
//Print the answers to all queries
System.out.println(output);
}
}