Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • Home
  • SEARCH
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 9064063
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 16, 20262026-06-16T16:09:14+00:00 2026-06-16T16:09:14+00:00

I am using a priority_queue<unsigned long,vector<unsigned long>,greater<unsigned long> > in C++ and I have

  • 0

I am using a priority_queue<unsigned long,vector<unsigned long>,greater<unsigned long> > in C++ and I have a memory limit of 16MB. My program only needs 10MB, but as soon as it gets to 8653464 Bytes it tries to double its capacity and throws a bad_alloc.

Is there a way to stop this using my current implementation? Can a priority_queue have log(n) time still if I switch to a deque [from a vector]?

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-06-16T16:09:16+00:00Added an answer on June 16, 2026 at 4:09 pm

    Switching to deque is very sensible approach. It grow by fixed number, not by x2 as vector. And complexity should stay O(log N).

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I'm using priority_queue with a vector as an underlying container. However I expect the
#include <iostream> #include <queue> using namespace std; struct Call { Call( int callNum, long
I am having trouble compiling a program I have written. I have two different
I want to implement a timer queuing system using the C++ STL priority_queue container
I have written a code that solves MST using Prim method. I read that
I am trying to use priority_queue, and program constantly fails with error message HEAP
So I'm using the STL priority_queue<> with pointers... I don't want to use value
Im developing an A* for the first time, and I was using a priority_queue
here is my code for multiway priority queue implementation #include<iostream> #include<vector> using namespace std;
I am using struct minHeap to generate a min heap using priority_queue .And function

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.