Cod sursă (job #495589)

#include <bits/stdc++.h>

using namespace std;

long long p[5000001],k=0,z,d,n,t=0,aux=0,i;

int main ()
{
  ifstream cin ("lalele.in");
  ofstream cout ("lalele.out");
  cin>>n;
  while (cin>>z>>d)
  {
    if (d!=0)
    {
      aux+=z;
      for (i=1;i<=z;i++)
      {
        k++,p[k]=d+i-1-aux;
      }
    }
    else
    {
      for (i=1;i<=z;i++)
      {
        aux++;
        nth_element(p+1,p+k/2+1,p+k+1);
        cout<<p[k/2+1]/*+aux*/<<'\n';
        k/=2;
      }
    }
  }
  return 0;
}