之前一直想了解优先队列 以后会有相关补充
namespace std{
template<
typename T,
typename Container =
vector<T>,
typename Compare = less<
typename Container::value_type>>
class priority_queue;
}
std::priority_queue<
float> pbuffer;
std::priority_queue<
float,
deque<float>> pbuffer;
std::priority_queue<
float,
vector<float>,greater<
float>> pbuffer;
转载请注明原文地址: https://www.6miu.com/read-12622.html