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.

[322, 229, 416, 465, 100, 351, 237, 310, 400, 303, 202, 290, 141, 273, 63, 72, 71, 65, 106, 305]

[322, 229, 416, 63, 100, 351, 237, 310, 400, 303, 202, 290, 141, 273, 465, 72, 71, 65, 106, 305]