Nearest Value - python coding challenges - Py.CheckiO

**I saw this same challenge posted but they went about it a different way.**

**I am trying to use a dictionary to sort the values by their difference from the given integer**

**The problem I am having is that if two values are the same distance apart you must pick the lower value. My code returns the higher value and to me it seems arbitrary?**

You are given a list of values as set form and a value for which you need to find the nearest one.

**For example** , we have the following set of numbers: **4, 7, 10, 11, 12, 17,** and we need to find the nearest value to the number 9. If we sort this set in the ascending order, then to the left of number 9 will be number 7 and to the right - will be number 10. But 10 is closer than 7, which means that the correct answer is 10.

A few clarifications:

- If 2 numbers are at the same distance, you need to choose the smallest one;
- The set of numbers is always non-empty, i.e. the size is >=1;
- The given value can be in this set, which means that it’s the answer;
- The set can contain both positive and negative numbers, but they are always integers;
- The set isn’t sorted and consists of unique numbers.

**Input:** Two arguments. A list of values in the set form. The sought value is an int.

**Output:** Int.

```
def nearest_value(values: set, y: int):
new_dict = {}
for x in values:
new_dict.update({abs(y-x): x})
new_list = sorted(new_dict.keys())
return new_dict[new_list[0]]
```