C++改变优先队列汇总

最新推荐文章于 2023-08-22 08:00:00 发布

阿狸崔

最新推荐文章于 2023-08-22 08:00:00 发布

阅读量510

点赞数

文章标签： c++

原文链接：https://blog.csdn.net/qq_40691051/article/details/102874220?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522164024878816780271537661%2522%252C%2522scm%2522%253A%252220140713.130102334.pc%255Fall.%2522%257D&request_id=164024878816780271537661&biz_i

版权

#include<iostream>
#include<vector>
#include<queue>
using namespace std; 

struct Node
{
	char data;
	int weight;
	Node(char _data, int _weight)
	{
		data = _data;
		weight = _weight;
	}
};
struct cmp1
{

	bool operator () (const Node &a, const Node &b)		  
	{
		return a.weight < b.weight;			//大的优先级高 
	}
}; 
struct cmp2
{
	bool operator()(const Node &a, const Node &b)		  
	{
		return a.weight > b.weight;			//小的优先级高 
	}
};
bool cmp(const Node &a,const Node &b)
{
	return a.weight > b.weight;
}
struct Node2 
{
	char data;
	int weight;
	Node2(char _data, int _weight)
	{
		data = _data;
		weight = _weight;
	}
	friend bool operator < (const Node2 &a,const Node2 &b)
	{
		return a.weight < b.weight; 
	} 
};
struct Node3 
{
	char data;
	int weight;
	Node3(char _data, int _weight)
	{
		data = _data;
		weight = _weight;
	}
	friend bool operator < (const Node3 &a,const Node3 &b)
	{
		return a.weight > b.weight; 
	} 
};
int main()
{
	string values = "ABCDEF";
	vector<int> weights = {1,2,3,4,5,6};
	priority_queue< Node, vector<Node>, cmp1> q1;
	for(int i = 0; i < values.length(); i++)
	{
		Node newNode(values[i],weights[i]); 
		q1.push(newNode);
	}
	cout<<"优先队列q1的第一个元素是:  "<<q1.top().data<<endl;
	
	priority_queue<Node,vector<Node>,cmp2> q2;
	for(int i = 0; i < values.length(); i++)
	{
		Node newNode(values[i],weights[i]); 
		q2.push(newNode);
	}
	cout<<"优先队列q2的第一个元素是:  "<<q2.top().data<<endl;
	
	priority_queue<Node2> q3;
	for(int i = 0; i < values.length(); i++)
	{
		Node2 newNode(values[i],weights[i]); 
		q3.push(newNode);
	}
	cout<<"优先队列q3的第一个元素是:  "<<q3.top().data<<endl;
	
	priority_queue<Node3> q4;
	for(int i = 0; i < values.length(); i++)
	{
		Node3 newNode(values[i],weights[i]); 
		q4.push(newNode);
	}
	cout<<"优先队列q4的第一个元素是:  "<<q4.top().data<<endl;
}