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 Go (1.14.1) (judge verdict: Wrong Answer)

package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"math"
)

var sc = bufio.NewScanner(os.Stdin)

// 1行読み込み
func nextLine() string {
	sc.Scan()
	return sc.Text()
}

// 読み込みをint型へキャスト
func nextInt() int {
	sc.Scan()
	num, err := strconv.Atoi(sc.Text())
	if(err != nil) {
		panic(err)
	}
	return num
}

// 読み込みをfloat型へキャスト
func nextFloat() float64 {
	sc.Scan()
	num, err := strconv.ParseFloat(sc.Text(), 64)
	if err != nil {
		panic(err)
	}
	return num
}

func main() {
	// scannerの挙動を改行区切り → 空白区切りに変更
	sc.Split(bufio.ScanWords)
	x := nextInt()
	n := nextInt()
	p_list := make([]int, 0, n)
	if n == 0 {
		fmt.Println(x)
		return
	}
	for i := 0; i < n; i++ {
		p_list = append(p_list, nextInt())
	}
	p_check := make([]int, 200, 200)
	p_check[x]++
	for _, i := range p_list {
		p_check[i - 1]++
	}

	x_next := x
	x_befo := x
	for i := x + 1; i < 1000; i++ {
		if p_check[i - 1] == 0 {
			x_next = i
			break
		}
	}
	for i := x - 1; i > -1000; i-- {
		if i == 0 {
			x_befo = i - 1
			break
		}
		if p_check[i - 1] == 0 {
			x_befo = i
			break
		}
	}
	next_abs := int(math.Abs(float64(x_next - x)))
	befo_abs := int(math.Abs(float64(x_befo - x)))

	if next_abs == befo_abs {
		fmt.Println(x_befo)
	} else if next_abs > befo_abs {
		fmt.Println(x_befo)
	} else {
		fmt.Println(x_next)
	}
}