Cod sursă (job #496943)

#include <fstream>
#include <algorithm>

using namespace std;

ifstream cin ("lalele.in");
ofstream cout ("lalele.out");

int n, t, x, m, cnt;

int h[5000005], d[5000005];

int main() {
  cin >> n;
  while(cin >> t >> x) {
    if(x) {
      for(int i = 1; i <= t; i++)
        h[++m] = x, d[m] = ++cnt;
    } else {
      for(int i = 1; i <= m; i++)
        h[i] += cnt - d[i], d[i] = cnt;
      for(int i = 1; i <= t; i++) {
        cnt++;
        nth_element(h + 1, h + m / 2 + 1, h + m + 1);
        m /= 2;
        cout << h[m + 1] + cnt - d[m + 1] << "\n";
      }
    }
  }
  return 0;
}