COCI '07 Contest 1 #3 Prinova

Points: 7 (partial)

Time limit: 0.6s

Memory limit: 32M

Problem type

Brojko and Brojana are happily married with $N$ ~N~ little boys. The boys are named with distinct even integers $P_1, P_2, \dots, P_N$ ~P_1, P_2, \dots, P_N~.

Brojko and Brojana are expecting an addition to their family and have to come up with a nice name for the little girl. They have decided that the name will be an odd integer in the range $[A, B]$ ~[A, B]~. Because they find all integers in that range equally beautiful, they have decided to choose the number which maximizes the distance to the name of the closest of the $N$ ~N~ boys.

More precisely, they seek an odd integer $X \in [A, B]$ ~X \in [A, B]~ such that the expression $\min \{|X-P_i|, i \in [1, N]\}$ ~\min \{|X-P_i|, i \in [1, N]\}~ is as large as possible.

Write a program that determines the name for the little girl. If there are multiple solutions, output any of them.

Input Specification

The first line contains an integer $N$ ~N~ $(1 \le N \le 100)$ ~(1 \le N \le 100)~, the number of boys. The second line contains $N$ ~N~ distinct even integers, the names of the boys. The integers will be less than $10^9$ ~10^9~. The third line contains the integers $A$ ~A~ and $B$ ~B~ $(1 \le A < B \le 10^9)$ ~(1 \le A < B \le 10^9)~, the range of names they are considering for the girl.

Output Specification

Output an integer, the name for the little girl.

Sample Input 1

3
2 6 16
20 50

Sample Output 1

Sample Input 2

3
2 6 16
3 15

Sample Output 2

Sample Input 3

3
2 6 16
1 7

Sample Output 3

Comments

0

cjspdoly commented on Oct. 2, 2025, 1:49 a.m.

lmao

11

dxke02 commented on Nov. 9, 2020, 4:10 p.m.

What sort of parents name their kids with numbers?