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.

Example input: [1,45,67,43,58,98,41,34,57]
Example output: [98,45,67,43,58,1,41,34,57]
Example explanation: 1 is the minimum element and 98 is the maximum element and their positions are swapped in the resulting list.
Q: [327, 436, 340, 301, 485, 256, 28, 448, 492, 271, 276, 431, 130, 359, 91, 221, 319, 87, 157, 224]
A:
[327, 436, 340, 301, 485, 256, 492, 448, 28, 271, 276, 431, 130, 359, 91, 221, 319, 87, 157, 224]