Given the task definition and input, reply with output. 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.

[373, 11, 221, 335, 379, 78, 180, 303, 453, 359, 80, 298, 100, 433, 428, 96, 125, 45, 48, 139]

[373, 453, 221, 335, 379, 78, 180, 303, 11, 359, 80, 298, 100, 433, 428, 96, 125, 45, 48, 139]