Given the task definition, example input & output, solve the new input case.
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: [1,45,67,43,58,98,41,34,57]
Output: [98,45,67,43,58,1,41,34,57]
1 is the minimum element and 98 is the maximum element and their positions are swapped in the resulting list.

New input case for you: [77, 481, 445, 178, 275, 58, 42, 168, 92, 136, 390, 498, 133, 333, 396, 85, 243, 283, 323, 322]
Output:
[77, 481, 445, 178, 275, 58, 498, 168, 92, 136, 390, 42, 133, 333, 396, 85, 243, 283, 323, 322]