-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtwo-arrays.cpp
More file actions
56 lines (43 loc) · 727 Bytes
/
Copy pathtwo-arrays.cpp
File metadata and controls
56 lines (43 loc) · 727 Bytes
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
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int T;
cin>>T;
while(T)
{
int N;
unsigned long long target;
cin>>N>>target;
vector<int> elemsA, elemsB;
for(int i=0; i<N; i++)
{
int temp;
cin>>temp;
elemsA.push_back(temp);
}
for(int i=0; i<N; i++)
{
int temp;
cin>>temp;
elemsB.push_back(temp);
}
sort(elemsA.begin(), elemsA.end());
sort(elemsB.begin(), elemsB.end());
bool flag = true;
for(int i=0; i<N; i++)
{
if( elemsA[i] + elemsB[N-1-i] < target )
flag = false;
}
if(flag)
cout<<"YES"<<endl;
else
cout<<"NO"<<endl;
T--;
}
return 0;
}