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.

[10, 163, 396, 358, 325, 207, 211, 253, 26, 473, 353, 164, 444, 274, 313, 228, 329, 128, 294, 387]
Output:
[473, 163, 396, 358, 325, 207, 211, 253, 26, 10, 353, 164, 444, 274, 313, 228, 329, 128, 294, 387]