 Permutations in array
##### Submissions: 1648   Accuracy: 36.04%   Difficulty: Basic   Marks: 1

Given two arrays of equal size N and an integer K. The task is to check if after permuting both arrays, we get sum of their corresponding element greater than or equal to k i.e Ai + Bi >= K for i =0 to N-1.

Input:
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. Each test case contains three lines.The first line of input contains two integers N and K. Then in the next two lines are space separated elements of the array A and B.

Output:
For each test case, print "1" (without quotes) if sum is possible(for whole array) else "0" (without quotes).

Constraints:
1 <= T <= 100
1 <= N <=103

1 <= K <= 107
1 <= Ai, Bi<= 1018

Example:
Input:

2
3 10
2 1 3
7 8 9
4 5
1 2 2 1
3 3 3 4

Output:
1
0

Explanation:
Testcase 1:
K=10 here. A can be written as {1 2 3} and B can be written as {9 8 7} so that for all i A[i]+B[i]>=K

#### ** For More Input/Output Examples Use 'Expected Output' option **

Author: Shubham Joshi 1

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.