Problems > Closest Two Values

Closest Two Values

Difficulty: 1000 3000 ms 128 MB

greedy sorting

Print the minimum absolute difference between any two elements.

Input: the first line has N (N ≥ 2); the second line has N integers.

Output: the smallest |ai − aj| over pairs i ≠ j.

Constraints:

  • 2 ≤ N ≤ 105
  • −109 ≤ ai ≤ 109

Sample Tests

Input 1
4
7 2 10 4
Output 1
2
Input 2
2
5 5
Output 2
0

Read the Editorial

Discussion (opens after you solve — no spoilers before)

No comments yet.

Submit Your Solution

Log in or create a free account to run and submit code.