Submit solution

Points:
10 (partial)

Time limit:
1.0s

Memory limit:
512M

Author:

Problem type

Allowed languages

Ada, Assembly, Awk, Brain****, C, C#, C++, COBOL, ~~CommonLisp~~, D, Dart, F#, Forth, Fortran, Go, ~~Groovy~~, Haskell, Intercal, Java, JS, Kotlin, Lisp, Lua, ~~Nim~~, ~~ObjC~~, OCaml, ~~Octave~~, Pascal, Perl, PHP, Pike, Prolog, Python, Racket, Ruby, Rust, Scala, Scheme, Sed, Swift, TCL, Text, Turing, VB, Zig

##### 2017 Fall Waterloo Local ACM Contest, Problem C

Vera has integers . A *margin* is a non-negative integer such that it is possible to choose integers such that for all , , the interval contains at least of Vera's integers and also contains .

Compute the minimum possible margin.

#### Input

Line contains integers and .

Line contains integers, .

#### Output

Print one line with one integer, the minimum possible margin.

#### Sample Input

```
5 3
1 -2 10 5 4
```

#### Sample Output

`6`

#### Note

For the first example, one possible solution is to choose , which is illustrated below.

## Comments