-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathreplacing-elements.cpp
52 lines (48 loc) · 996 Bytes
/
replacing-elements.cpp
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
#include <iostream>
using namespace std;
int main()
{
int n, k;
int iterations;
cin >> iterations;
bool found = false;
int max = -1;
while (iterations--)
{
max = -1;
cin >> n >> k;
int arr[n];
for (int arrIdx = 0; arrIdx < n; arrIdx++)
{
cin >> arr[arrIdx];
if (arr[arrIdx] >= max)
{ max = arr[arrIdx];
}
}
if (max <= k) {
found = true;
}
if (!found)
{
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
if ((arr[i] + arr[j] <= k) && i != j)
{
found = true;
}
}
}
}
if (found)
{
cout << "YES" << endl;
}
else
{
cout << "NO" << endl;
}
found = false;
}
}