You will be given a definition of a task first, then some input of the task.
In this task, you are given a list of unique integers you need to swap the positions of maximum and minimum element in the list and return the updated list.

[182, 64, 494, 59, 159, 69, 430, 78, 420, 90, 397, 265, 101, 19, 201, 58, 157, 393, 314, 460]
Output:
[182, 64, 19, 59, 159, 69, 430, 78, 420, 90, 397, 265, 101, 494, 201, 58, 157, 393, 314, 460]