queue — FIFO. priority_queue — sorted by priority.
std::queue:
1std::queue<int> q;2q.push(1);3q.push(2);4q.push(3);5std::cout << q.front(); // 1 (first in)
std::priority_queue:
1std::priority_queue<int> pq;2pq.push(3);3pq.push(1);4pq.push(2);5std::cout << pq.top(); // 3 (largest)
Custom comparator:
1// Min-heap2std::priority_queue<int, std::vector<int>, std::greater<int>> min_pq;