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:
[33, 439, 485, 138, 228, 443, 339, 421, 118, 21, 215, 182, 220, 265, 186, 153, 160, 43, 213, 256]
Answer:
[33, 439, 21, 138, 228, 443, 339, 421, 118, 485, 215, 182, 220, 265, 186, 153, 160, 43, 213, 256]