Implement a heap-based priority queue that supports the following additional operation in linear time:
replace Comparator(c): Replace the current comparator with c. After changing the comparator, the heap will need to be restructured.