Prinova

#include<bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
using ii=long long;
const ii inf = 1e9;
int main()
{
    ii n;
    cin >> n;
    vector<ii> v(n + 2);
    v[0] = -inf;
    for (ii i = 0; i < n; ++i) {
        cin >> v[i + 1];
    }
    v.back() = inf;
    sort(all(v));
    ii a, b;
    cin >> a >> b;
    pair<ii, ii> res;
    for (ii i = 1; i <= n + 1; ++i) {
        ii loc = max(a, (v[i] + v[i - 1]) / 2);
        loc = min(loc, b);
        assert(a <= loc);
        assert(loc <= b);
        for (ii j = -5; j <= 5; ++j) {
            loc += j;
            if (loc & 1 && a <= loc && loc <= b) {
                res = max(res, make_pair(min(loc - v[i - 1], v[i] - loc), loc));
            }
            loc -= j;
        }
    }
    cout << res.second << "\n";
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED