Kthe Largest Element

PQueue.cpp

#include <iostream>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#include <cstdio>

using namespace std;

struct compare {
  bool operator()(const int& l, const int& r) {
    return l > r;
  }
};

priority_queue <int, vector<int>, compare> m;
priority_queue <int> s;
int N;

int main() {
  int nq,q,x;
  scanf("%d", &nq);
  while(nq--){
    scanf("%d", &q);
    if (q == 2) {
      while (m.size() < N/3) {
        m.push(s.top()); 
        s.pop();
      }
      while (m.size() > N/3) {
        s.push(m.top()); 
        m.pop();
      }
      if (m.size() == 0)
        printf("No reviews yet\n");
      else
        printf("%d\n", m.top());
    } else if (q==1) {
      scanf("%d", &x);
      if (m.size() && x > m.top())
        m.push(x);
      else
        s.push(x);
      N++;
    }
  }
  return 0;
}