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.

[464, 105, 267, 441, 38, 294, 359, 117, 236, 133, 81, 190, 465, 456, 485, 167, 474, 468, 458, 447]
Output:
[464, 105, 267, 441, 485, 294, 359, 117, 236, 133, 81, 190, 465, 456, 38, 167, 474, 468, 458, 447]