UTDCS2-07

#### Start

2020-08-01 09:00 AKDT

## UTDCS2-07

#### End

2020-08-01 11:00 AKDT
The end is near!
Contest is over.
Not yet started.
Contest is starting in -49 days 19:00:13

2:00:00

0:00:00

# Problem BDirty Driving

Like all other good drivers, you like to curse, swear and honk your horn at your fellow automobile drivers. Today you’re at the rear of a long line, brooding over the others’ inability to keep proper distance to the car in front. But are you really keeping your own distance?

You have calculated that in order to never have to use your breaks, you must keep a distance to any car $x$ in front of you at least $p(n+1)$ where $n$ is the number of cars between you and $x$, and $p$ is an integer constant determined by which of your cars you are currently driving.

Given the value of $p$ and the current distances (in random order) to each of the cars ahead of you, calculate the minimum distance you should be keeping to the car directly in front, in order to not have to use your breaks.

## Input

First a line with $1 \leq n \leq 100\, 000$ – the number of cars ahead of you – and $1 \leq p \leq 20$ – the deceleration constant.

Then a single line with $n$ unique integers denoting the current distance to each of the cars ahead of you. Each of these integers are in the interval $[1, 10^7]$

## Output

The minimum distance you must keep to the car directly in front, in order to not have to use your breaks.

Sample Input 1 Sample Output 1
3 1
1 2 4

1

Sample Input 2 Sample Output 2
6 3
2 3 4 5 6 1

13