Problem:
Score : 300 points

Problem Statement

Given are an integer X and an integer sequence of length N: p_1, \ldots, p_N.

Among the integers not contained in the sequence p_1, \ldots, p_N (not necessarily positive), find the integer nearest to X, that is, find the integer whose absolute difference with X is the minimum. If there are multiple such integers, report the smallest such integer.

Constraints

1 \leq X \leq 100

0 \leq N \leq 100

1 \leq p_i \leq 100

p_1, \ldots, p_N are all distinct.

All values in input are integers.

Input

Input is given from Standard Input in the following format:

X N
p_1 ... p_N

Output

Print the answer.

Sample Input 1

6 5
4 7 10 6 5

Sample Output 1

8

Among the integers not contained in the sequence 4, 7, 10, 6, 5, the one nearest to 6 is 8.

Sample Input 2

10 5
4 7 10 6 5

Sample Output 2

9

Among the integers not contained in the sequence 4, 7, 10, 6, 5, the ones nearest to 10 are 9 and 11. We should print the smaller one, 9.

Sample Input 3

100 0

Sample Output 3

100

When N = 0, the second line in the input will be empty. Also, as seen here, X itself can be the answer.

Solution in Rust (1.42.0) (judge verdict: Wrong Answer)

use std::collections::HashMap;

fn main() {
    let inputs: Vec<i32> = read_vec();
    let x = inputs[0];
    let n = inputs[1];

    let num_dict = conv_dict(&read_vec::<i32>());

    if n == 0 {
        println!("{}", x);
        return;
    }

    // xからマイナス方向に探索
    let mut min_num = 0;
    for i in (0..x).rev() {
        if let Some(_) = num_dict.get(&i) {
            continue;
        }
        min_num = i;
        break;
    }

    // xからプラス方向に探索
    let mut max_num = 0;
    let mut i = x + 1;
    loop {
        if let Some(_) = num_dict.get(&i) {
            i += 1;
            continue;
        }
        max_num = i;
        break;
    }

    // 最短を計算
    let result = if x - min_num <= max_num - x {
        min_num
    } else {
        max_num
    };

    println!("{}", result);
}

fn conv_dict(nums: &Vec<i32>) -> HashMap<i32, i32> {
    let mut map = HashMap::new();
    for num in nums {
        map.insert(*num, 0);
    }
    return map;
}

fn read<T: std::str::FromStr>() -> T {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim().parse().ok().unwrap()
}

fn read_vec<T: std::str::FromStr>() -> Vec<T> {
    read::<String>()
        .split_whitespace()
        .map(|e| e.parse().ok().unwrap())
        .collect()
}