cookie selection

cookie selection.cpp

#include <iostream>
#include <string>
#include <algorithm>
#include <queue>
#include <vector>

using namespace std;


int main() {

      string s;
      priority_queue <int> max_pq;
      priority_queue <int, vector<int>, greater<int> > min_pq;
      int val=0;

      while (cin>>s) {

          if (s!="#") {

              val = stoi(s);
              if(min_pq.size()==0){
                  min_pq.push(val);
              } else {
                    int d_min = min_pq.top();
                    if(val>d_min) {
                        printf("adding value of min priority queue %d\n", val);
                        min_pq.push(val);
                        if(min_pq.size() > (max_pq.size()+1)) {
                            d_min = min_pq.top();
                            printf("pop %d from min priority queue to max \n", d_min);
                            min_pq.pop();
                            max_pq.push(d_min);
                        }
                    } else {
                        max_pq.push(val);
                        printf("adding value of max priority queue %d\n", val);
                        if (max_pq.size() > min_pq.size()){
                            int d_max = max_pq.top();
                            printf("pop %d from max priority queue to min \n", d_max);
                            max_pq.pop();
                            min_pq.push(d_max);
                        }
                    }
              }

          } else {
               int d_min = min_pq.top();
               printf("value of min priority queue %d\n", d_min);
               min_pq.pop();
               if (min_pq.size()!=max_pq.size()){

                   int d_max = max_pq.top();
                   printf("trasnferrign from max to min priority queue %d\n", d_max);
                   max_pq.pop();
                   min_pq.push(d_max);
               }
               printf("%d\n", d_min);
          }

      }//while loop ends */
 

}//main