On what data structure is the standard library priority queue based?

Heap. Specifically, a max-heap by default, providing access to the maximum element in $O(1)$. Insertion and deletion operations take $O(\log N)$, where $N$ is the number of elements.