-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path1183B.cpp
54 lines (34 loc) · 904 Bytes
/
1183B.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
53
54
#include<bits/stdc++.h>
using namespace std;
//// kowasdasdsadsadasdasdasdasdasd
int main()
{
int q;
cin >> q;
long long int n , k;
for(int i=0; i<q; i++)
{
cin >> n >> k;
long long int price[n];
for(int j=0; j<n; j++)
cin >> price[j];
sort(price , price+n);
long long int min = price[0];
// cout << min << endl;
long long int ans = min + k;
int flag = 0;
for(int l=0; l<n; l++)
{
if(abs(ans-price[l])<=k)
continue;
else
{
cout << -1 << endl;
flag = 1;
break;
}
}
if(flag == 0)
cout << ans << endl;
}
}