数据结构
网络
RDBMS
操作系统
Java
Microsoft Excel
iOS
HTML
CSS
Android
Python
C 编程
C++
C#
MongoDB
MySQL
JavaScript
PHP
物理学
化学
生物学
数学
英语
经济学
心理学
社会学
时尚研究
法律研究C++ 中结构或类优先队列
STL 优先队列是大顶堆的实现。
这是 C++ 中针对结构的 STL 优先队列的一个程序。
算法
Begin Define a structure of type student. Initialize variables in student structure. Define another structure of type comparemarks Overload the variables of student structure in comapremarks structure. Use priority queue with structure. Insert some elements in priority queue using student structure. While the queue is not empty do Print the elements. End.
示例代码
#include <iostream>
#include <queue>
using namespace std;
#define ROW 6
#define COL 3
struct student { //defining the student structure
int roll,marks;
student(int roll, int marks)
: roll(roll), marks(marks)
{
}
};
struct comparemarks{ // defining the comparemarks structure
bool operator()(student const& s1, student const& s2)
//overloading the operators of the student structure
{
return s1.marks < s2.marks;
}
};
int main()
{
priority_queue<student, vector<student>, comparemarks> M;
// using the priority queue. We have to use this type of syntax to use the priority queue.
int a[ROW][COL] = {{15, 50}, {16, 60},
{18,70}, {14, 80}, {12, 90}, {20, 100}};
for (int i = 0; i < ROW; ++i) {
M.push(student(a[i][0], a[i][1])); //inserting variables in the queue
}
cout<<"priority queue for structure ::"<<endl;
while (!M.empty()) {
student s = M.top();
M.pop();
cout << s.roll << " " << s.marks << "\n"; //printing the values
}
return 0;
}输出
priority queue for structure :: 20 100 12 90 14 80 18 70 16 60 15 50
更新于：2019 年 7 月 30 日
已查看 573 次
广告