Practice
Resources
Contests
Online IDE
New
Free Mock
Scaler
Practice
Improve your coding skills with our resources
Contests
Compete in popular contests with top coders
Scaler
Explore Offerings by SCALER

Begin your success journey!

Sign Up using
Full name *
Email *
Password *

By creating an account, I acknowledge that I have read and agree to InterviewBit’s Terms and Privacy Policy .

Welcome back!

Log In using
Email *
Password *

Priority Queue

In priority queue, each element in the queue has its own priority. When we insert item into queue, we have to assign priority value with it.

  • Declaration

    priority_queue<int> pq; (creates a priority_queue, default it is equivalent to max heap)  
    // To create min Heap  
    priority_queue<int, vector<int>, greater<int> > pq;
  • Size:

    int size = pq.size();
  • Pushing an integer into a Priority queue:

    pq.push(x); (where x is an integer.The size increases by 1 after this.)
  • Getting the maximum/minimum element from max/min priority queue

    pq.top()
  • Popping the maximum/minimum element from max/min priority queue

    pq.pop(); (After this the size decreases by 1)

Try the following example in the editor below.

Given an array of integers A representing the length of ropes.

You need to connect these ropes into one rope. The cost of connecting two ropes is equal to the sum of their lengths.

Find and return the minimum cost to connect these ropes into one rope.

Constraints

1 <= length of the array <= 100000
1 <= A[i] <= 1000

Input Format

The only argument given is the integer array A.

Output Format

Return an integer denoting the minimum cost to connect these ropes into one rope.

Sample Input

A = [1, 2, 3, 4, 5]

Sample Output

33
Start solving Priority Queue on Interview Code Editor
Hints
  • Complete Solution

Discussion


Loading...
Click here to start solving coding interview questions
Free Mock Assessment
Fill up the details for personalised experience.
All fields are mandatory
Current Employer *
Enter company name *
Graduation Year *
Select an option *
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
Phone Number *
OTP will be sent to this number for verification
+1 *
+1
Change Number
Phone Number *
OTP will be sent to this number for verification
+1 *
+1
Change Number
Graduation Year *
Graduation Year *
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
*Enter the expected year of graduation if you're student
Current Employer *
Company Name *
Please verify your phone number
Edit
Resend OTP
By clicking on Start Test, I agree to be contacted by Scaler in the future.
Already have an account? Log in
Free Mock Assessment
Instructions from Interviewbit
Start Test