priority_queue
std::priority_queue<int, std::vector<int>, std::greater<int>>priority_queue
std::priority_queue<int, std::vector<int>, std::greater<int>>priority queue stl
#include<iostream>
#include<queue>
#include<algorithm>
using namespace std;
int main()
{
priority_queue<int>pq;
int n=5;
while(n--)
{
int val;
cout<<"enter the value you want to insert:"<<endl;
cin>>val;
pq.push(val);
}
priority_queue<int>p;
p.push(100);
p.push(1000);
p.push(3000);
p.push(5000);
pq.swap(p);
while(!pq.empty())
{
cout<<pq.top()<<" ";
pq.pop();
}
return 0;
}priority queue
function PriorityQueue() {
this.collection = [];
this.printCollection = function () {
console.log(this.collection);
};
// Only change code below this line
this.enqueue = function (newitem) {
if (this.isEmpty()) {
return this.collection.push(newitem);
}
this.collection = this.collection.reverse();
var found_index = this.collection.findIndex(function (item) {
return newitem[1] >= item[1];
});
if (found_index === -1) {
this.collection.push(newitem);
} else {
this.collection.splice(found_index, 0, newitem);
}
this.collection = this.collection.reverse();
};
this.dequeue = function () {
if (!this.isEmpty()) {
return this.collection.shift()[0];
} else {
return "The queue is empty.";
}
};
this.size = function () {
return this.collection.length;
};
this.front = function () {
return this.collection[0][0];
};
this.isEmpty = function () {
return this.size() > 0 ? false : true;
};
// Only change code above this line
}priority
Defect priority is the amount of urgency
to fixing that defect. Has fast bug has
to be fixed. We were discussing in grooming meeting.
Developers and PO determines the level of priorityCopyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us
