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.

[254, 409, 441, 99, 74, 292, 395, 136, 447, 233, 367, 112, 185, 327, 22, 454, 271, 319, 293, 200]
Output:
[254, 409, 441, 99, 74, 292, 395, 136, 447, 233, 367, 112, 185, 327, 454, 22, 271, 319, 293, 200]