In this kata, your job is to return the two distinct highest values in a list. If there're less than 2 unique values, return as many of them, as possible.
The result should also be ordered from highest to lowest.
Examples:
```
[4, 10, 10, 9]  =>  [10, 9]
[1, 1, 1]  =>  [1]
[]  =>  []
```
def two_highest(arg1):
    x = []
    y = []
    z = []
    if len(arg1) == 0:
        return []
    elif len(arg1) == 1:
        return arg1
    else:
        
        x = sorted(arg1, reverse = True)
        for i in range(len(x)):
            if x[i] in y:
                y = y
            else:
                y.append(x[i])
        z.append(y[0])
        z.append(y[1])
        return z
def two_highest(arg1):
    x = []
    y = []
    z = []
    if len(arg1) == 0:
        return []
    elif len(arg1) == 1:
        return arg1
    else:
        
        x = sorted(arg1, reverse = True)
        for i in range(len(x)):
            if x[i] in y:
                y = y
            else:
                y.append(x[i])
        z.append(y[0])
        z.append(y[1])
        return z