CodeForces/AliceandBob.cpp at main · codeAntariksh/CodeForces · GitHub

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
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
const int MOD = 1e9 + 7;

void solve(vector<int> &arr,int a)
{
	int n = arr.size();
	vector<int> diffarr;
	for(auto &x:arr)
	{
		diffarr.push_back(abs(x-a));
	}
	int index = 0;
	for(int i=0;i<n;i++)
	{
		if(diffarr[i]<diffarr[index])
			index = i;
	}
	int ind = 0;
	if(index>=n/2)
	{
		int temp = index;
		while(true)
		{
			temp--;
			if(diffarr[temp]!=diffarr[index])
			{
				ind = temp;
				break;
			}
			if(temp==0)
			{
				ind = -1;
				break;
			}
		}
	}
	else
	{
		int temp = index;
		while(true)
		{
			temp++;
			if(diffarr[temp]!=diffarr[index])
			{
				ind = temp;
				break;
			}
			if(temp==n-1)
			{
				ind = -1;
				break;
			}
		}
	}
	if(ind!=-1)
	{
		cout<<arr[ind]<<endl;
	}
	else cout<<arr[n-1]<<endl;
	return;
}

int32_t main()
{
	ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
	int t=1;
	cin>>t;
	while(t--)
	{
		int n,a;
		cin>>n>>a;
		vector<int> arr(n);
		for (auto &c:arr)
			cin>>c;
		solve(arr,a);
	}
	return 0;
}