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:
[447, 60, 249, 247, 486, 14, 193, 173, 451, 144, 12, 405, 308, 202, 132, 65, 160, 184, 348, 203]
Answer:
[447, 60, 249, 247, 12, 14, 193, 173, 451, 144, 486, 405, 308, 202, 132, 65, 160, 184, 348, 203]