C++最小堆/最大堆的构造
#include <iostream>
#include <queue>
using namespace std;
struct node
{
string name;
int value;
node(string name_, int value_) : name(name_), value(value_) {}
friend bool operator < (const node& a, const node& b)
{
return a.value < b.value;
}
};
int main(int argc, char* argv[])
{
priority_queue<node> p_qu{};
return 0;
}
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
struct node
{
string name;
int value;
node(string name_, int value_) : name(name_), value(value_) {}
};
struct compare
{
bool operator()(const node& a, const node& b)
{
return a.value < b.value;
}
};
int main(int argc, char* argv[])
{
priority_queue<node, vector<node>, compare> p_qu{};
return 0;
}
#include <iostream>
#include <set>
#include <vector>
using namespace std;
struct node
{
int index;
int value;
node(int i, int j) : index(i), value(j) {}
};
struct compare
{
bool operator()(const node& a, const node& b)
{
return a.value < b.value;
}
};
int main()
{
vector<int> nums{2, 8, 4, 1, 9, 5};
multiset<node, compare> m_set{};
for (int i = 0; i < nums.size(); i++)
{
node n(i, nums[i]);
m_set.insert(n);
}
for (auto it = m_set.begin(); it != m_set.end(); it++)
cout << it->value << endl;
return 0;
}