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.

Let me give you an example: [1,45,67,43,58,98,41,34,57]
The answer to this example can be: [98,45,67,43,58,1,41,34,57]
Here is why: 1 is the minimum element and 98 is the maximum element and their positions are swapped in the resulting list.

OK. solve this:
[362, 207, 161, 47, 268, 177, 18, 311, 12, 137, 368, 493, 300, 447, 140, 448, 495, 405, 388, 244]
Answer:
[362, 207, 161, 47, 268, 177, 18, 311, 495, 137, 368, 493, 300, 447, 140, 448, 12, 405, 388, 244]