Prinova

#include <iostream>
#include <algorithm>
#define F first
#define S second

using namespace std;

int d[100];
pair<int, pair<int, int> > p;

int main(){

    int n, a, b;
    cin >> n;

    for(int i=0; i<n; i++) cin >> d[i];

    cin >> a >> b;
    if(!(a&1)) a++;
    if(!(b&1)) b--;

    sort(d, d+n);

    for(int i=1; i<n; i++){
        if(d[i-1]>=a && d[i-1]+(d[i]-d[i-1])/2 <= b && d[i]-d[i-1] > p.F){
            p = {d[i]-d[i-1], {d[i-1], d[i]}};
        }
    }

    if(a<d[0] && (d[0]-a >= p.F)){
        p.F = d[0]-a;

        if(b>d[n-1] && (b-d[n-1] >= p.F)){
            cout << b;
            return 0;
        }

        cout << a;
        return 0;
    }

    if(!((p.S.F+p.F/2)&1)) p.S.F++;
    cout << p.S.F+p.F/2;

    return 0;
}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: ACCEPTED

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: ACCEPTED