Priority Queue Top

A priority queue keeps the highest-priority value available at the top.

priority_queue_top.cpp

#include <iostream>
#include <queue>

int main() {
    int urgent = ;

    std::priority_queue<int> priorities;
    priorities.push(4);
    priorities.push(urgent);
    priorities.push(9);

    int top = priorities.top();
    int size = static_cast<int>(priorities.size());

    std::cout << "top=" << top << std::endl;
    std::cout << "size=" << size << std::endl;
    return 0;
}

#include <iostream>
#include <queue>

int main() {
    int urgent = ;

    std::priority_queue<int> priorities;
    priorities.push(4);
    priorities.push(urgent);
    priorities.push(9);

    int top = priorities.top();
    int size = static_cast<int>(priorities.size());

    std::cout << "top=" << top << std::endl;
    std::cout << "size=" << size << std::endl;
    return 0;
}

#include <iostream>
#include <queue>

int main() {
    int urgent = ;

    std::priority_queue<int> priorities;
    priorities.push(4);
    priorities.push(urgent);
    priorities.push(9);

    int top = priorities.top();
    int size = static_cast<int>(priorities.size());

    std::cout << "top=" << top << std::endl;
    std::cout << "size=" << size << std::endl;
    return 0;
}

priority queue A `std::priority_queue` exposes the largest value first by default.

top `top` reads the current highest-priority value without removing it.